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

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(E^{0.5} V log(V)$ log(U))

Space Complexity

$O(V^{2})$ words

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

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

PRAM

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_(Parallel)_(Integer_Maximum_Flow_Maximum_Flow)&oldid=47836"