Mucha and Sankowski ( Maximum-Weight Matching): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2004 == Reference == https://dl.acm.org/doi/10.1109/FOCS.2004.40") |
(No difference)
|
Latest revision as of 12:15, 15 February 2023
Time Complexity
$O(n^{3})$
Space Complexity
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
2004