edmonds-karp algorithm

In computer science and graph theory, the Edmonds-Karp algorithm is an implementation of the Ford-Fulkerson method for computing the 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 runs in O(VE²) 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 ACM.

External link

The 1972 paper in PDF format, at the JACM Web site

<< Previous

Word Browser

Next >>

isaac watts
maria antonietta beluzzi
lucius appuleius saturninus
gaius memmius
humphrey gilbert
the british museum is falling down
tommy bolin
lefkada
upton, london
provinces of cuba
manor, georgia

list of uk place names with royal patronage
music of washington
tribhuvan of nepal
hordes of the things
muzak
list of uk organisations with royal patronage
william jones
fictional national animals
drop bear
university of waikato
madge oberholtzer

william boog leishman
university of nevada, las vegas
healing
anti modernist oath
bone healing
david bisbal
l. r. ford
d. r. fulkerson
the war of the ring
d. c. stephenson
miss saigon

fernie alpine resort
crushing by elephant
the history of the lord of the rings
devonport, tasmania
baby boom
wrapped reichstag
mahamudra
lotusscript
university of nevada, reno
killer instinct
nationalist terrorism