Kathuria, Liu, Sidford ( Maximum Flow): Difference between revisions
Jump to navigation
Jump to search
No edit summary Tags: Manual revert Reverted |
No edit summary Tag: Manual revert |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(E^({ | $O(E^({4}/{3}+o({1})$)U^({1}/{3})) | ||
== Space Complexity == | == Space Complexity == | ||
| Line 15: | Line 15: | ||
== Approximate? == | == Approximate? == | ||
Exact | |||
== Randomized? == | == Randomized? == | ||
Revision as of 12:17, 15 February 2023
Time Complexity
$O(E^({4}/{3}+o({1})$)U^({1}/{3}))
Space Complexity
$O(E)$ or $O(V^{2})$ ? words
(unsure, please look)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2020