Get Free Shipping on orders over $79
Network Flow Algorithms - David P. Williamson

Network Flow Algorithms

By: David P. Williamson

eBook | 5 September 2019

At a Glance

eBook


RRP $75.96

$64.99

14%OFF

or 4 interest-free payments of $16.25 with

 or 

Instant Digital Delivery to your Kobo Reader App

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.

on

More in Computer Science

Amazon.com : Get Big Fast - Robert Spector

eBOOK

AI-Powered Search - Trey Grainger

eBOOK

Tissue Proteomics : Methods and Protocols - Taufika Islam Williams

eBOOK

RRP $369.00

$332.99

10%
OFF