Goldberg & Rao (Parallel) (Integer Maximum Flow Maximum Flow)

From Algorithm Wiki

Revision as of 12:17, 15 February 2023 by Admin (talk | contribs)

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

Jump to navigation Jump to search

Time Complexity

$O(V^{1.66} log(V)$ log(U))

Space Complexity

$O(V^{2})$ words

(https://dl.acm.org/citation.cfm?id=290181)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

PRAM

Year

1997

Reference

https://dl.acm.org/citation.cfm?id=290181

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