Cheriyan et al. (st-Maximum Flow Maximum Flow)
Jump to navigation
Jump to search
Time Complexity
$O(V^{3} / \log V)$
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
Uniform-Cost RAM (is this the same as Word RAM?)
Year
1990