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