samik@CS.UOREGON.EDU (01/05/90)
I am looking for an implementation of the Maximum Weighted Matching algorithm for non-bipartite graphs. This algorithm is described in * J. Edmonds, Matching and a polyhedron with 0-1 vertices, J. Res. Nat. Bur. Standards Sect.B, 69 (1965) and in * E. Lawler, Combinatorial Optimization, Networks and Matroids, Holt, Rinehart and Winston, pp 251-252. If you have an implementation (preferably ftp-able) please reply by e-mail. I would also like to know of any references to this algo. which describe it *completely*. The references I have cited leave out a lot of important details. Thanking you in anticipation, -- Samik Gupta University of Oregon, Internet: samik@cs.uoregon.edu Eugene, OR 97403. 503-686-4140.