Network Flow Algorithms
Download and Read Network Flow Algorithms full books in PDF, ePUB, and Kindle. Read online free Network Flow Algorithms ebook anywhere anytime directly on your device. We cannot guarantee that every ebooks is available!
Network Flow Algorithms
Author | : David P. Williamson |
Publisher | : Cambridge University Press |
Total Pages | : 327 |
Release | : 2019-09-05 |
Genre | : Computers |
ISBN | : 1316946665 |
Download Network Flow Algorithms Book in PDF, Epub and Kindle
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.
Network Flow Algorithms Related Books
Pages: 327
Pages: 327
Pages: 224
Pages: 870
Pages: 138