Tell your friends about this item:
Network Flow Algorithms Williamson, David P. (Cornell University, New York)
Do you have a profile? Log in
Get notified about new Williamson, David P. (Cornell University, New York) releases
Our customers say:
Add to your iMusic wish list
Network Flow Algorithms
Williamson, David P. (Cornell University, New York)
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 Hardcover Book (Book with hard spine and cover) |
| Released | September 5, 2019 |
| ISBN13 | 9781107185890 |
| Publishers | Cambridge University Press |
| Pages | 326 |
| Dimensions | 236 × 158 × 17 mm · 586 g |
| Language | English |
