Galil & Naamad ( Maximum Flow)

From Algorithm Wiki

Revision as of 09:30, 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 \log^{2} V)$

Space Complexity

$O(E)$ words

(https://core.ac.uk/download/pdf/81946904.pdf)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1980

Reference

https://core.ac.uk/download/pdf/81946904.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Galil_%26_Naamad_(_Maximum_Flow)&oldid=47287"