Mucha and Sankowski ( Maximum-Weight Matching)
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