Solvers for the Cardinality and Weighted Matching Problem

The original site of the source codes available here is
ftp://dimacs.rutgers.edu/pub/netflow/matching/ of the Center for Discrete
Mathematics and Theoretical Computer Science (DIMACS): Rutgers University,
Princeton University, AT&T Bell Laboratories, Bellcore, see also D.S. Johnson /
C.C. McGeoch: Dimacs Implementation Challenge Workshop, Algorithms for
Network Flows and and Matching, DIMACS Technical Report 92-4, or
http://dimacs.rutgers.edu/Challenges/, notably for information on the DIMACS
graph input format.

card-match.tar.Z
     C code for solving the cardinality matching problem based on Gabow's
     N-cubed non-weighted matching algorithm, see H.N. Gabow: An Efficient
     Implementation of Edmond's Algorithm for Maximum Matching on Graphs,
     JACM, Vol. 23, 1976, implementation by E. Rothberg

 readme  -  General information on program by author

cardmp.f.Z
     FORTRAN Code for solving the cardinality matching problem based on the
     Micali-Vazirani algorithm, see S. Micali / V.V. Vazirani, An O((V * E) ½)
     Algorithm for Finding Maximum Matchings in General Graphs, Proc. 21st
     Annual Symposium on Foundation of Computer Science, IEEE, 1980, for
     information on algorithm, implementation by R.B. Mattingly and N.P. RitcheY

 info  -  General information on program by authors

w-match.tar.Z
     C code for finding a maximum weight matching in an undirected graph based on
     Gabow's N-cubed weighted matching algorithm, see H. Gabow, Implementation
     of Algorithms for Maximum Matching on Nonbipartite Graphs, Ph.D. thesis,
     Stanford University, 1973

 readme  -  General information on program by author