C++ implementation of algorithms for finding perfect matchings in general graphs
A python implementation of Edmonds blossom algorithm for maximum-cardinality matching.
A C++ implementation of Edmonds' blossom algorithm to find maximum matchings in general graphs
Python implementation of algorithms for maximum cardinality matching and maximum cost assignment in bipartite graphs
Comparing GPU-communication frameworks. World-first multi-GPU maximum cardinality bipartite matching.
maximum cardinality matching by Edmonds' algorithm, an implementation based on union find data structure
Add a description, image, and links to the maximum-cardinality-matching topic page so that developers can more easily learn about it.
To associate your repository with the maximum-cardinality-matching topic, visit your repo's landing page and select "manage topics."