Advertisement

Journal of Electronics (China)

, Volume 6, Issue 3, pp 220–231 | Cite as

Improvement and realization for the maximum weight matching algorithm

  • Xu Zhicai
Article

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.

Key words

Optimization algorithm for graph Maximum weight matching Ascending order adjacency matrix End-result matrix 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

Copyright information

© Science Press 1989

Authors and Affiliations

  • Xu Zhicai
    • 1
  1. 1.Beijing University of Posts and TelecommunicationsBeijing

Personalised recommendations