Network Flow Algorithms

by David P. Williamson

2020-07-02 18:23:39

Compare Price
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 appl... Read more
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. Less

Book Details

File size8.94 X 5.98 X 0.75 in
Print pages326
PublisherCambridge University Press
Publication date September 5, 2019
Languageeng
ISBN9781316952894

Compare Prices

Store Availability Book Format Condition Price
Indigo Books & Music In Stock Paperback Paperback Buy CAD 45.95
eBooks.com In Stock Buy GBP 21.50
Indigo Books & Music In Stock Hard Cover Hard Cover Buy CAD 114.95
Indigo Books & MusicIn Stock
Format
Paperback
Condition
Paperback
Buy CAD 45.95
eBooks.comIn Stock
Format
Condition
Buy GBP 21.50
Indigo Books & MusicIn Stock
Format
Hard Cover
Condition
Hard Cover
Buy CAD 114.95
Available Discount
No Discount available

Join us and get access to all
your favourite books

Sign up for free and start exploring thousands of eBooks today.

Sign up for free