- Publisher: Cambridge University Press
- Online publication date: August 2019
- Print publication year: 2019
- Online ISBN: 9781316888568
- DOI: https://doi.org/10.1017/9781316888568
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.
Toshihide Ibaraki - Kyoto College of Graduate Studies for Informatics, Japan
Kurt Mehlhorn - Max-Planck-Institut für Informatik
* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.
Usage data cannot currently be displayed