Vertel uw vrienden over dit artikel:
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
| Media | Boeken Paperback Book (Boek met zachte kaft en gelijmde rug) |
| Vrijgegeven | 5 september 2019 |
| ISBN13 | 9781316636831 |
| Uitgevers | Cambridge University Press |
| Pagina's | 326 |
| Afmetingen | 151 × 227 × 18 mm · 492 g |
| Taal en grammatica | Engels |