Re: Maximum matching
David Eppstein <[email protected]>
| Newsgroups | gmane.comp.mathematics.csc |
|---|---|
| Organization | Information and Computer Science, UC Irvine |
| Message-ID | <[email protected]> |
Iain Duff <[email protected]> wrote: > Further to Sivan's comments, there is also my MC21 code that is available > from ACM TOMS algorithms (through netlib) as Algorithm 575. Of course, > many of you may have seen or used the weighted transversal algorithm (that > uses quite different algorithms) of Duff and Koster, called MC64. ... > > Alex Pothen has a Fortran 77 code for finding maximum matchings > > in bipartite graphs, which John and I have used. I also have a Python implementation of the Hopcroft-Karp bipartite maximum matching algorithm available at http://aspn.activestate.com/ASPN/Cookbook/Python/Recipe/123641 -- David Eppstein http://www.ics.uci.edu/~eppstein/ Univ. of California, Irvine, School of Information & Computer Science