Edmonds & Karp ( Maximum Flow)

From Algorithm Wiki

Revision as of 08:30, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(E^{2} \log U)$

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

1972

Reference

https://web.eecs.umich.edu/~pettie/matching/Edmonds-Karp-network-flow.pdf

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