Mucha and Sankowski ( Maximum-Weight Matching)

From Algorithm Wiki

Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (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.ezproxy.canberra.edu.au/doi/10.1109/FOCS.2004.40")

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

Jump to navigation Jump to search

Time Complexity

$O(n^{3})$

Space Complexity

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

2004

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1109/FOCS.2004.40

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Mucha_and_Sankowski_(_Maximum-Weight_Matching)&oldid=45312"