Micali and Vazirani ( Maximum Cardinality Matching)

From Algorithm Wiki

Revision as of 09:19, 28 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(V^{0.5} E)$

Space Complexity

$O(V)$ not mentioned

(https://link.springer.com/content/pdf/10.1007/PL00009186.pdf)

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

No, deterministic

Model of Computation

Restricted Randomness (RR)

Year

1980

Reference

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Micali_and_Vazirani_(_Maximum_Cardinality_Matching)&oldid=47798"