Phillips & Westbrook (st-Maximum Flow Maximum Flow): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(VE(Log(V;V/E)) + V^{2}(LogV)^{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 == Reference == https://dl.acm.org/citation.cfm?id=167201") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(VE( | $O(VE(\log(V;V/E)) + V^{2}(\log V)^{2} )$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 09:33, 10 April 2023
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