Chen et al ( Maximum Flow)
Jump to navigation
Jump to search
Time Complexity
$O(E^({1}+o({1})$)*log(U))
Space Complexity
$O(E)$ words
((derived in notes))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2022