Galil & Naamad ( Maximum Flow)

From Algorithm Wiki
Revision as of 10:32, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(VELog^{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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(VELog^{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=44393"