Goldberg & Rao (Parallel) (Integer Maximum Flow Maximum Flow)
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/citation.cfm?id=290181)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
PRAM
Year
1997