Network Flow Algorithms - Williamson, David P. (Cornell University, New York) - Books - Cambridge University Press - 9781316636831 - September 5, 2019
In case cover and title do not match, the title is correct

Williamson, David P. (Cornell University, New York)
Network Flow Algorithms

Get an email once the item is available
Do you have a profile? Log in
Get notified about new Williamson, David P. (Cornell University, New York) releases

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

Not rated yet

This comprehensive text and reference for graduate students and professionals in theoretical computer science, operations research, and discrete math offers an up-to-date, unified view of efficient combinatorial algorithms for a wide variety of network flow problems, including recent work on computing electrical flows and their applications.

326 pages, Worked examples or Exercises; 1 Halftones, black and white; 51 Line drawings, black and w

Media Books     Paperback Book   (Book with soft cover and glued back)
Released September 5, 2019
ISBN13 9781316636831
Publishers Cambridge University Press
Pages 326
Dimensions 151 × 227 × 18 mm   ·   492 g
Language English  

More from the same publisher

See all of Williamson, David P. (Cornell University, New York) ( e.g. Hardcover Book and Paperback Book )