Micali and Vazirani ( Maximum Cardinality Matching)

From Algorithm Wiki

Revision as of 10:34, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{0.5} E)$ == Space Complexity == $O(V)$ not mentioned (https://link-springer-com.ezproxy.canberra.edu.au/content/pdf/10.1007/PL00009186.pdf) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == Restricted Randomness (RR) == Year == 1980 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1109/SFCS.1980.12")

(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.ezproxy.canberra.edu.au/content/pdf/10.1007/PL00009186.pdf)

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

No, deterministic

Model of Computation

Restricted Randomness (RR)

Year

1980

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1109/SFCS.1980.12

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