Alt, Blum, Mehlhorn, Paul (bipartite graph Maximum cardinality matching)

From Algorithm Wiki

Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{1.5}*(E/logV)$^{0.5}) == Space Complexity == $O(E)$ auxiliary? words (Uses constant number of O(E)-sized data structures in pseudocode of algorithm) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == Yes, == Model of Computation == Word RAM == Year == 1991 == Reference == https://www.sciencedirect.com/science/article/pii/002001909190195N")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(V^{1.5}*(E/logV)$^{0.5})

Space Complexity

$O(E)$ auxiliary? words

(Uses constant number of O(E)-sized data structures in pseudocode of algorithm)

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

Yes,

Model of Computation

Word RAM

Year

1991

Reference

https://www.sciencedirect.com/science/article/pii/002001909190195N

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Alt,_Blum,_Mehlhorn,_Paul_(bipartite_graph_Maximum_cardinality_matching)&oldid=45637"