Pastāsti draugiem par šo preci:
Network Flow Algorithms Williamson, David P. (Cornell University, New York)
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
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2019. gada 5. septembris |
| ISBN13 | 9781316636831 |
| Izdevēji | Cambridge University Press |
| Lapas | 326 |
| Izmēri | 151 × 227 × 18 mm · 492 g |
| Valoda | Angļu |
Mere med samme udgiver
Skatīt visus Williamson, David P. (Cornell University, New York) ( piem., Hardcover Book un Paperback Book )