Blum (General Graph MCM Maximum Cardinality Matching): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O((V^{0.5})$E) == Space Complexity == $O(E)$ auxiliary?? words (Each phase, creates a separate directed graph and solves a reachability problem on it. Can reuse space across phases) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1990 == Reference == https://web.eecs.umich.edu/~pettie/matching/Blum-matching-ICALP90.pdf") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O(E)$ | $O(E)$?? words | ||
(Each phase, creates a separate directed graph and solves a reachability problem on it. Can reuse space across phases) | (Each phase, creates a separate directed graph and solves a reachability problem on it. Can reuse space across phases) | ||
Latest revision as of 08:56, 10 April 2023
Time Complexity
$O((V^{0.5})$E)
Space Complexity
$O(E)$?? words
(Each phase, creates a separate directed graph and solves a reachability problem on it. Can reuse space across phases)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1990
Reference
https://web.eecs.umich.edu/~pettie/matching/Blum-matching-ICALP90.pdf