Gabow; Tarjan (General Graph MCM Maximum Cardinality Matching)
Jump to navigation
Jump to search
Time Complexity
$O((V^{0.5})$E)
Space Complexity
$O(E)$? words
(https://web.eecs.umich.edu/~pettie/matching/Gabow-Tarjan-scaling-general-graph-matching.pdf)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1991
Reference
https://web.eecs.umich.edu/~pettie/matching/Gabow-Tarjan-scaling-general-graph-matching.pdf