Edmonds-Karp Algorithm

Edmonds-Karp Algorithm

List price: US$38.00

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks


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.
show more

Product details

  • Paperback | 60 pages
  • 152 x 229 x 4mm | 100g
  • United States
  • English
  • black & white illustrations
  • 6136157993
  • 9786136157993