Sleator & Tarjan ( Maximum Flow)
Jump to navigation
Jump to search
Time Complexity
$O(VE \log V)$
Space Complexity
$O(E)$ words
(can be derived?)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1983
Reference
https://www.sciencedirect.com/science/article/pii/0022000083900065