Edmonds–Karp algorithm: Difference between revisions

Revision as of 15:32, 22 October 2005

Revision as of 19:19, 22 October 2005

Line 1:

In [[computer science]] and [[graph theory]], the '''Edmonds-Karp algorithm''' is an implementation of the [[Ford-Fulkerson algorithm|Ford-Fulkerson method]] for computing the [[maximum flow problem|maximum flow]] in a [[flow network]]. The distinguishing feature is that the shortest augmenting path is used at each step, which guarantees that the computation will terminate. In most implementations, the shortest augmenting path is found using a [[breadth-first search]].

The Edmonds-Karp algorithm [[Big O notation|runs in O(VE²E*V*log(V)) time]], where V is the number of vertices and E is the number of edges in the network.

The Edmonds-Karp algorithm was elucidated in the 1972 paper "Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems," by [[Jack Edmonds]] and [[Richard Karp]], in the ''Journal of the [[Association for Computing Machinery|ACM]]''.