Phillips & Westbrook (st-Maximum Flow Maximum Flow)
Jump to navigation
Jump to search
Time Complexity
$O(VE(\log(V;V/E)) + V^{2}(\log V)^{2} )$
Space Complexity
$O(V + E)$ words
(Derived: essentially the same as (CH89) above but derandomized)
Description
Derandomization of Cheriyan & Hagerup
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1993