Skip to main content
SpringerLink
Log in

Improvement and realization for the maximum weight matching algorithm

  • Published:
Journal of Electronics (China)

Abstract

Some new concepts of effective incidence matrix, ascending order adjacency matrix and end-result vertex are introduced, and some improvements of the maximum weight matching algorithm are made. With this method a computer program in FORTRAN language is realized on the computers FELIX C-512 and IBM-PC. Good results are obtained in practical operations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Edmonds, Maximum Matching and a Polyhedron with 0,1-VertexesJ. of research of the National Bureau of Standards,69B (1965), 125–130.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Beijing University of Posts and Telecommunications, Beijing

    Xu Zhicai

Authors
  1. Xu Zhicai
    View author publications

    You can also search for this author in PubMed Google Scholar

About this article

Cite this article

Zhicai, X. Improvement and realization for the maximum weight matching algorithm. J. of Electron.(China) 6, 220–231 (1989). https://doi.org/10.1007/BF02778903

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02778903

Key words

Search

Navigation