Gabow, Galil, Spencer (general Maximum-weight matching)

From Algorithm Wiki
Revision as of 11:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(mn*log(log(log(n)$/log({2}+m/n))) + n^{2}*log(n)) == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1989 == Reference == https://ieeexplore.ieee.org/abstract/document/715935")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(mn*log(log(log(n)$/log({2}+m/n))) + n^{2}*log(n))

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1989

Reference

https://ieeexplore.ieee.org/abstract/document/715935

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Gabow,_Galil,_Spencer_(general_Maximum-weight_matching)&oldid=45651"