Fredman-Tarjan (Edmonds-Karp-based) (bipartite (i.e. assignment), general Maximum-weight matching)

From Algorithm Wiki

Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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/doi/10.1145/28869.28874")

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

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/doi/10.1145/28869.28874

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Fredman-Tarjan_(Edmonds-Karp-based)_(bipartite_(i.e._assignment),_general_Maximum-weight_matching)&oldid=45646"