Edmonds-Karp Algorithm
Jump to navigation
Jump to search
An Edmonds-Karp Algorithm is a Ford–Fulkerson algorith that ...
- See: Dinic's Algorithm, Maximum Flow Problem, Flow Network, Big O Notation, Jack Edmonds, Richard Karp.
References
2017
- (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/Edmonds–Karp_algorithm Retrieved:2017-6-21.
- 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 E2) time. The algorithm was first published by Yefim Dinitz in 1970 and independently published by Jack Edmonds and Richard Karp in 1972. Dinic's algorithm includes additional techniques that reduce the running time to O(V2 E).