Goldberg & Tarjan ( Maximum Flow): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(VELog(V^{2}/E))$ == Space Complexity == $O(E)$ words (can be derived? also hints of space complexity might be in the paper) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1986 == Reference == https://www.cs.princeton.edu/courses/archive/fall03/cs528/handouts/a%20new%20approach.pdf") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(VE \log (V^{2}/E))$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 09:33, 10 April 2023
Time Complexity
$O(VE \log (V^{2}/E))$
Space Complexity
$O(E)$ words
(can be derived? also hints of space complexity might be in the paper)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1986
Reference
https://www.cs.princeton.edu/courses/archive/fall03/cs528/handouts/a%20new%20approach.pdf