Alon (st-Maximum Flow Maximum Flow): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "== Time Complexity == $O(VE + V^{({2.66})}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 == Word RAM == Year == 1990 == Reference == https://www.sciencedirect.com/science/article/pii/002001909090024R")
 
No edit summary
 
Line 1: Line 1:
== Time Complexity ==  
== Time Complexity ==  


$O(VE + V^{({2.66})}LogV)$
$O(VE + V^{2.{6}6} \log V)$


== Space Complexity ==  
== Space Complexity ==  

Latest revision as of 09:33, 10 April 2023

Time Complexity

$O(VE + V^{2.{6}6} \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

Word RAM

Year

1990

Reference

https://www.sciencedirect.com/science/article/pii/002001909090024R