Goldberg & Rao (Integer Maximum Flow Maximum Flow)

From Algorithm Wiki

Revision as of 10:36, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(E^{1.5} Log(V^{2}/E) LogU)$ == Space Complexity == $O(V + E)$ words (Derived: creates and updates an auxiliary graph) == Description == Finding blocking flows == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1997 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/citation.cfm?id=290181")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(E^{1.5} Log(V^{2}/E) LogU)$

Space Complexity

$O(V + E)$ words

(Derived: creates and updates an auxiliary graph)

Description

Finding blocking flows

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1997

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/citation.cfm?id=290181

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Goldberg_%26_Rao_(Integer_Maximum_Flow_Maximum_Flow)&oldid=44548"