Cheriyan et al. (st-Maximum Flow Maximum Flow)
Revision as of 11:36, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{3} / LogV)$ == 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")
Time Complexity
$O(V^{3} / LogV)$
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