Edmonds Karp Algorithm Computer Science (1 results)

Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In computerscience and graph theory, the Edmonds-Karp algorithm is animplementation of the Ford-Fulkerson method for computing the maximumflow in a flow network in O time. It is asymptotically slower than therelabel-to-front algorithm, which runs in O time, but it is often fasterin practice for sparse graphs. The algorithm was first published by aSoviet scientist, Yefim Dinic, in 1970, and independently by JackEdmonds and Richard Karp in 1972. Dinic's algorithm includes additionaltechniques that reduce the running time to O.…