King et al. (KRT) (st-Maximum Flow Maximum Flow)
Revision as of 11:36, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(VE + V^{({2}+eps)})$ == 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 == 1992 == Reference == https://dl.acm.org/citation.cfm?id=139438")
Time Complexity
$O(VE + V^{({2}+eps)})$
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
1992