Goldberg & Rao (Parallel) (Integer Maximum Flow Maximum Flow): Difference between revisions
Jump to navigation
Jump to search
No edit summary Tags: Manual revert Reverted |
No edit summary Tag: Manual revert |
||
| (4 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(E^{0.5} V log(V)$ log(U)) | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 10:40, 28 April 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