Fredman-Tarjan (Edmonds-Karp-based) (bipartite (i.e. assignment), general Maximum-weight matching)
Jump to navigation
Jump to search
Time Complexity
$O(mn+n^{2}log(n)$)
Space Complexity
$O(n^{2})$ words
(^see above)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1984
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/28869.28874