Johnson (Edmonds-Karp-based) (bipartite (i.e. assignment), general Maximum-weight matching)
Jump to navigation
Jump to search
Time Complexity
$O(mn*log(n)$/log({2}+m/n))
Space Complexity
$O(n^{2})$ words
(^see above)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1975
Reference
https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0020019075900010