Goldberg & Rao (Integer Maximum Flow Maximum Flow): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(E^{1.5} 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 == Reference == https://dl.acm.org/citation.cfm?id=290181") |
No edit summary Tag: Reverted |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(V^{0.{6}6}E Log(V^{2}/E) LogU)$ | ||
== Space Complexity == | == Space Complexity == | ||
Revision as of 11:36, 15 February 2023
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