Micali and Vazirani ( Maximum Cardinality Matching)
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/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/doi/10.1109/SFCS.1980.12")
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