Edmonds & Karp ( Maximum Flow): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(E^{2}LogU)$ == 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") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(E^{2} | $O(E^{2} \log U)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 08:30, 10 April 2023
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