Blum (General Graph MCM Maximum Cardinality Matching)

From Algorithm Wiki

Revision as of 11:14, 15 February 2023 by Admin (talk | contribs) (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")

(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(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

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