Network flow algorithms /

Williamson, David P.

Network flow algorithms / David P. Williamson - United Kingdom Cambridge University Press 2019 - 314 p.

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 present 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.

9781316636831 9781107185890 (hardback : alk. paper)

2019011352


Network analysis (Planning)--Computer programs.
System theory.
Computer algorithms.

003 WIL-D
An institution deemed to be a University Estd. Vide Sec.3 of the UGC
Act,1956 under notification # F.12-23/63.U-2 of Jun 18,1964

© 2015 BITS-Library, BITS-Hyderabad, India.