Looking for an examination copy?
If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact firstname.lastname@example.org providing details of the course you are teaching.
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.Read more
- 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, JapanSee more reviews
'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
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Publication planned for: October 2019
- format: Paperback
- isbn: 9781316636831
- length: 326 pages
- dimensions: 227 x 152 x 19 mm
- weight: 0.48kg
- contains: 52 b/w illus.
- availability: Not yet published - available from October 2019
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.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×