Ahuja & Orlin ( Maximum Flow): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(VE + V^{2}LogU)$ == Space Complexity == $O(ELogU)$ words (derived in sheet) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1987 == Reference == https://www.researchgate.net/publication/38008130_A_Fast_and_Simple_Algorithm_for_the_Maximum_Flow_Problem") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(VE + V^{2} | $O(VE + V^{2} \log U)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 09:33, 10 April 2023
Time Complexity
$O(VE + V^{2} \log U)$
Space Complexity
$O(ELogU)$ words
(derived in sheet)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1987