Alon (st-Maximum Flow Maximum Flow)

From Algorithm Wiki
Revision as of 08:33, 10 April 2023 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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