Goldberg & Tarjan ( Maximum Flow)
Jump to navigation
Jump to search
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