Goldberg & Rao (Integer Maximum Flow Maximum Flow): Difference between revisions
Jump to navigation
Jump to search
No edit summary Tag: Manual revert |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(E^{1.5} \log(V^{2}/E) \log U)$ | ||
== Space Complexity == | == Space Complexity == | ||
Revision as of 09:33, 10 April 2023
Time Complexity
$O(E^{1.5} \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