Gabow (general Maximum-weight matching): Difference between revisions
Jump to navigation
Jump to search
(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/docview/287948024?pq-origsite=gscholar&fromopenview=true") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n^{ | $O(mn+n^{2}log(n)$) | ||
== Space Complexity == | == Space Complexity == | ||
$O(m)$ words | |||
() | (https://dl.acm.org/doi/10.5555/320176.320229) | ||
== Description == | == Description == | ||
| Line 27: | Line 27: | ||
== Year == | == Year == | ||
1990 | |||
== Reference == | == Reference == | ||
https:// | https://dl.acm.org/doi/10.5555/320176.320229 | ||
Revision as of 12:18, 15 February 2023
Time Complexity
$O(mn+n^{2}log(n)$)
Space Complexity
$O(m)$ words
(https://dl.acm.org/doi/10.5555/320176.320229)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1990