Ahuja & Orlin ( 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} \log U)$

Space Complexity

$O(ELogU)$ words

(derived in sheet)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1987

Reference

https://www.researchgate.net/publication/38008130_A_Fast_and_Simple_Algorithm_for_the_Maximum_Flow_Problem

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Ahuja_%26_Orlin_(_Maximum_Flow)&oldid=47319"