Alon (st-Maximum Flow Maximum Flow)

From Algorithm Wiki
Revision as of 11:36, 15 February 2023 by Admin (talk | contribs) (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.ezproxy.canberra.edu.au/science/article/pii/002001909090024R")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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.ezproxy.canberra.edu.au/science/article/pii/002001909090024R

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Alon_(st-Maximum_Flow_Maximum_Flow)&oldid=44545"