Maximum cardinality matching in general graphs 1.1

Operating systemsOS : Windows / Linux / Mac OS / BSD / Solaris
Program licensingScript Licensing : Other Free / Open Source License - Python License
CreatedCreated : Jun 7, 2007
Size downloadDownloads : 6
Program licensing
Thank you for voting...

This is an implementation of Edmonds' ...

This is an implementation of Edmonds' blossom-contraction algorithm for Maximum cardinality matching in general graphs by David Eppstein.

Maximum cardinality matching in general graphs 1.1 scripting tags: cardinality, graphs, contraction algorithm, general graphs, maximum, edmonds, implementation, matching, cardinality matching, blossomcontraction. What is new in Maximum cardinality matching in general graphs 1.1 software script? - Unable to find Maximum cardinality matching in general graphs 1.1 news. What is improvements are expecting? Newly-made Maximum cardinality matching in general graphs 1.2 will be downloaded from here. You may download directly. Please write the reviews of the Maximum cardinality matching in general graphs. License limitations are unspecified.