In computer science, the Edmonds–Karp algorithm is an implementation of the Ford–Fulkerson method for computing the maximum flow in a flow network in O ( | V | | E | 2 ) {\displaystyle O(|V||E|^{2})} time. The algorithm was first published by Yefim Dinitz in 1970, and independently published by Jack Edmonds and Richard Karp in 1972.
In computer science, the Edmonds–Karp algorithm is an implementation of the Ford–Fulkerson method for computing the maximum flow in a flow network in O ( | V | | E | 2 ) {\displaystyle O(|V||E|^{2})} time. The algorithm was first published by Yefim Dinitz in 1970, and independently published by Jack Edmonds and Richard Karp in 1972.
Source: Wikipedia "Edmonds–Karp algorithm" · CC BY-SA 4.0
Share this article: X · Bluesky