Network Flow Algorithms
Network Flow Algorithms
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.
- Presents results in the area from a modern computer science algorithms outlook
- Contains several key algorithms not previously treated in book form, including new algorithms on electrical flow
- Includes fifty-five end-of-chapter exercises which provide applications and additional algorithms to analyze
Reviews & endorsements
'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, SIGACT News
Product details
September 2019Hardback
9781107185890
326 pages
235 × 157 × 22 mm
0.58kg
52 b/w illus.
Available
Table of Contents
- 1. Preliminaries: shortest path algorithms
- 2. Maximum flow algorithms
- 3. Global minimum cut algorithms
- 4. More maximum flow algorithms
- 5. Minimum-cost circulation algorithms
- 6. Generalized flow algorithms
- 7. Multicommodity flow algorithms
- 8. Electrical flow algorithms
- 9. Open questions.
