Gabow (general Maximum-weight matching)

From Algorithm Wiki

Revision as of 09:42, 28 April 2023 by Admin (talk | contribs)

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

Jump to navigation Jump to search

Time Complexity

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

Space Complexity

$O(m)$ words

(https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.5555/320176.320229)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1990

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.5555/320176.320229

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