Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Books
  3. Network Flow Algorithms
  • Cited by 28
Publisher:
Cambridge University Press
Online publication date:
August 2019
Print publication year:
2019
Online ISBN:
9781316888568
DOI:
https://doi.org/10.1017/9781316888568
Subjects:
Algorithmics, Complexity, Computer Algebra, Computational Geometry, Engineering, Computer Science, Control Systems and Optimisation
Information

Book description

Network flow theory has been used across a number of disciplines, including theoretical computer science, operations research, and discrete math, to model not only problems in the transportation of goods and information, but also a wide range of applications from image segmentation problems in computer vision to deciding when a baseball team has been eliminated from contention. This graduate text and reference presents a succinct, unified view of a wide variety of efficient combinatorial algorithms for network flow problems, including many results not found in other books. It covers maximum flows, minimum-cost flows, generalized flows, multicommodity flows, and global minimum cuts and also presents recent work on computing electrical flows along with recent applications of these flows to classical problems in network flow theory.

Reviews

‘More than half a century since network flow theory was introduced by the 1962 book of L. R. Ford and D. R. Fulkerson, the area is still active and attractive. This book, based on course materials taught at Stanford and Cornell Universities, offers a concise and succinct description of most of the important topics, as well as covering recent developments. Its use in graduate courses related to algorithms and optimization is highly recommended.'

Toshihide Ibaraki - Kyoto College of Graduate Studies for Informatics, Japan

'A succinct and very readable account of network flow algorithms covering the classics and the latest developments. The perfect book for a course on network flow algorithms and a reference for the state of the art. It will be a frequently used addition to my bookshelf.'

Kurt Mehlhorn - Max-Planck-Institut für Informatik

‘The book includes many lemmas and theorems with proofs. It provides a succinct, amalgamated view of a broad mixture of effective combinatorial algorithms for network flow problems, including many topics not found in other textbooks … I strongly recommend the book for students and researchers.’

S. V. Nagaraj Source: SIGACT News

Refine List

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

Contents

Contents
References

Metrics

Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Book summary page views

Total views: 0 *
Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed.