Alt, Blum, Mehlhorn, Paul (bipartite graph Maximum cardinality matching)
Jump to navigation
Jump to search
Time Complexity
$O(V^{1.5}*(E/logV)$^{0.5})
Space Complexity
$O(E)$ auxiliary? words
(Uses constant number of O(E)-sized data structures in pseudocode of algorithm)
Description
Approximate?
Approximate
Approximation Factor:
Randomized?
Yes,
Model of Computation
Word RAM
Year
1991
Reference
https://www.sciencedirect.com/science/article/pii/002001909190195N