Edmonds-Karp (bipartite (i.e. assignment), general Maximum-weight matching)
Jump to navigation
Jump to search
Time Complexity
$O(n*(SP+))$ where $(SP+)$ denotes the time for one SSSP computation on a nonnegatively weighted graph. Initially $O(n^{3})$
Space Complexity
$O(n^{2})$ words
(Keeps track of current flow, which is of size O(n^2), and an O(n)-sized labeling function. SSSP computation has time bounded by O(n^2) and thus should use O(n^2) space at most)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1972