Gabow (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(n^{3})$ == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1974 == Reference == https://www-proquest-com.ezproxy.canberra.edu.au/docview/287948024?pq-origsite=gscholar&fromopenview=true")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{3})$

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1974

Reference

https://www-proquest-com.ezproxy.canberra.edu.au/docview/287948024?pq-origsite=gscholar&fromopenview=true

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Gabow_(general_Maximum-weight_matching)&oldid=45649"