Micali, Vazirani (general graph Maximum cardinality matching)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(V^{0.5} E)$

Space Complexity

$O(E)$ auxiliary? words

(Manipulates a constant number of graphs? Contractions can be kept track of in O(E) space)

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

Yes,

Model of Computation

Word RAM

Year

1980

Reference

https://ieeexplore.ieee.org/document/4567800