MKM Algorithm ( Maximum Flow)

From Algorithm Wiki
Revision as of 10:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{3})$ == Space Complexity == $O(E)$ words (https://core.ac.uk/download/pdf/81946904.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1978 == Reference == https://eprints.utas.edu.au/160/1/iplFlow.pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(V^{3})$

Space Complexity

$O(E)$ words

(https://core.ac.uk/download/pdf/81946904.pdf)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1978

Reference

https://eprints.utas.edu.au/160/1/iplFlow.pdf

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