James B Orlin's + KRT (King; Rao; Tarjan)'s algorithm (st-Maximum Flow Maximum Flow)

From Algorithm Wiki
Revision as of 10:36, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(VE)$ == Space Complexity == $O(V + E)$ words (Derived: creates and updates an auxiliary graph) == Description == Improvement of the KRT algorithm == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2013 == Reference == https://dl.acm.org/citation.cfm?id=2488705")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(VE)$

Space Complexity

$O(V + E)$ words

(Derived: creates and updates an auxiliary graph)

Description

Improvement of the KRT algorithm

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2013

Reference

https://dl.acm.org/citation.cfm?id=2488705

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=James_B_Orlin%27s_%2B_KRT_(King;_Rao;_Tarjan)%27s_algorithm_(st-Maximum_Flow_Maximum_Flow)&oldid=44550"