Skip to content
/ matching-project Public

maximum cardinality matching by Edmonds' algorithm, an implementation based on union find data structure

0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

yfzhang229/matching-project

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

15 Commits
graphs
graphs
 
 
Project.ipynb
Project.ipynb
 
 
README.md
README.md
 
 
match_tools.py
match_tools.py
 
 
matching.py
matching.py
 
 

Repository files navigation

Matching Project

Towards the maximum cardinality matching problem in general graphs, oue of the most remarkable work is the Edmonds' blossom algorithm. An implementation with the union find data structure can obtain $O(mn\alpha(m,n))$ complexity.

About

maximum cardinality matching by Edmonds' algorithm, an implementation based on union find data structure

Topics

union blossom-algorithm maximum-cardinality-matching

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages