Sleator & Tarjan ( Maximum Flow)

From Algorithm Wiki
Revision as of 10:36, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(VELogV)$ == 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.ezproxy.canberra.edu.au/science/article/pii/0022000083900065")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(VELogV)$

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.ezproxy.canberra.edu.au/science/article/pii/0022000083900065

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Sleator_%26_Tarjan_(_Maximum_Flow)&oldid=44540"