Synopsis
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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 in O time. It is asymptotically slower than the relabel-to-front algorithm, which runs in O time, but it is often faster in practice for sparse graphs. The algorithm was first published by a Soviet scientist, Yefim Dinic, in 1970, and independently by Jack Edmonds and Richard Karp in 1972. Dinic's algorithm includes additional techniques that reduce the running time to O.
"synopsis" may belong to another edition of this title.
Search results for Edmonds-Karp Algorithm: Computer science, Graph theory,...
Seller Image
Edmonds-Karp Algorithm
Print on DemandSeller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 60 pp. Englisch. Seller Inventory # 9786136157993
Buy New
US$ 136.11
US$ 68.35 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Seller Image
Edmonds-Karp Algorithm : Computer science, Graph theory, Ford-Fulkerson algorithm
Print on DemandSeller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering. Seller Inventory # 9786136157993
Buy New
US$ 137.73
US$ 68.96 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available