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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 60 pp. Englisch. N° de réf. du vendeur 9786136157993
Quantité disponible : 1 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering. N° de réf. du vendeur 9786136157993
Quantité disponible : 1 disponible(s)