Blum (General Graph MCM Maximum Cardinality Matching)
Jump to navigation
Jump to search
Time Complexity
$O((V^{0.5})$E)
Space Complexity
$O(E)$?? words
(Each phase, creates a separate directed graph and solves a reachability problem on it. Can reuse space across phases)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1990
Reference
https://web.eecs.umich.edu/~pettie/matching/Blum-matching-ICALP90.pdf