Goldberg & Rao (Integer Maximum Flow Maximum Flow)
Jump to navigation
Jump to search
Time Complexity
$O(V^{0.{6}6}E 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