Micali and Vazirani ( Maximum Cardinality Matching): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(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")
 
No edit summary
 
Line 33: Line 33:
== Reference ==  
== Reference ==  


https://dl.acm.org/doi/10.1109/SFCS.1980.12
https://ieeexplore.ieee.org/document/4567800

Latest revision as of 09:19, 28 April 2023

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://ieeexplore-ieee-org.ezproxy.canberra.edu.au/document/4567800