Dinitz (with dynamic trees) ( Maximum Flow)

From Algorithm Wiki
Revision as of 10:35, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(VELogU)$ == Space Complexity == $O(E)$ words (can be derived?) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1973 == Reference == https://www.scirp.org/(S(lz5mqp453edsnp55rrgjct55))/reference/ReferencesPapers.aspx?ReferenceID=1690549")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(VELogU)$

Space Complexity

$O(E)$ words

(can be derived?)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1973

Reference

https://www.scirp.org/(S(lz5mqp453edsnp55rrgjct55))/reference/ReferencesPapers.aspx?ReferenceID=1690549

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Dinitz_(with_dynamic_trees)_(_Maximum_Flow)&oldid=44538"