Network Flow Algorithms
By:
Sign Up Now!
Already a Member? Log In
You must be logged into Bookshare to access this title.
Learn about membership options,
or view our freely available titles.
- Synopsis
- 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.
- Copyright:
- 2019
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9781316946664
- Related ISBNs:
- 9781107185890, 9781107185890
- Publisher:
- Cambridge University Press
- Date of Addition:
- 09/05/19
- Copyrighted By:
- David P. Williamson
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Computers and Internet
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.