Edmonds & Karp ( Maximum Flow)
Jump to navigation
Jump to search
Time Complexity
$O(E^{2} \log U)$
Space Complexity
$O(E)$ words
(https://core.ac.uk/download/pdf/81946904.pdf)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1972
Reference
https://web.eecs.umich.edu/~pettie/matching/Edmonds-Karp-network-flow.pdf