Goldberg & Rao (Integer Maximum Flow Maximum Flow): Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary Tag: Manual revert |
| (One intermediate revision by the same user not shown) | |
(No difference)
| |
Latest revision as of 10:20, 28 April 2023
Time Complexity
$O(V^{0.{6}6}E \log(V^{2}/E) \log U)$
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