Maximum Weight Matching for non-bipartite graphs

Article View: comp.theory

Article #1988

#1988

From: samik
Date: Fri, 05 Jan 1990 02:07

20 lines
1104 bytes

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.

Technical Details

Message-ID: <9001050207.AA13257@spencer.cs.uoregon.edu>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!ucbvax!CS.UOREGON.EDU!samik

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!ucbvax!CS.UOREGON.EDU!samik
From: samik@CS.UOREGON.EDU
Newsgroups: comp.theory
Subject: Maximum Weight Matching for non-bipartite graphs
Message-ID: <9001050207.AA13257@spencer.cs.uoregon.edu>
Date: 5 Jan 90 02:07:44 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Lines: 20