View source for Cheriyan et al. (st-Maximum Flow Maximum Flow)

== 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

== Reference == 

https://link.springer.com/chapter/10.1007/BFb0032035