Network flow theory has been employed across a number of disciplines, including operations research, theoretical computer science, and discrete math, to model not only problems in the transportation of information and goods but also a broad range of applications from image segmentation problems in computer vision to determining when a baseball team has been removed from contention. Network Flow Algorithms (PDF) provides a succinct, unified view of an extensive variety of efficient combinatorial algorithms for network flow problems, comprising of many results not found in other ebooks. It includes maximum flows, minimum cost flows, multicommodity flows, generalized flows, and global minimum cuts and also presents the latest work on computing electrical flows along with recent applications of these flows to classical problems in network flow theory.
NOTE: The product only includes the ebook Network Flow Algorithms in PDF. No access codes are included.
Reviews
There are no reviews yet.