Tell your friends about this item:
Network Flow Algorithms Williamson, David P. (Cornell University, New York)
Price
HK$ 527
excl. VAT
Ordered from remote warehouse
Expected to be ready for shipping Nov 10 - 16
Christmas presents can be returned until 31 January
Get notified about new Williamson, David P. (Cornell University, New York) releases
Our customers say:
Add to your iMusic wish list
Also available as:
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 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 |
