Johnson (Edmonds-Karp-based) (bipartite (i.e. assignment), general Maximum-weight matching)
Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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/science/article/pii/0020019075900010")
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/science/article/pii/0020019075900010