Dinitz (with dynamic trees) ( Maximum Flow)
Jump to navigation
Jump to search
Time Complexity
$O(VE \log U)$
Space Complexity
$O(E)$ words
(The dynamic tree should take $O(E)$ extra space, and that should be the only extra space (if any) compared to Dinitz's original algorithm. Thus, this requires $O(E)$ space.)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1973