Povej prijatelju o tem izdelku:
Network Flow Algorithms Williamson, David P. (Cornell University, New York)
Do you have a profile? Prijava
Prejemajte obvestila o novih izdajah izvajalca Williamson, David P. (Cornell University, New York)
Kaj pravijo naše stranke:
Dodaj na svoj seznam želja iMusic
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
| Medij | Knjige Paperback Book (Knjiga z mehkimi platnicami in lepljenim hrbtom) |
| Izdano | 5. septembra 2019 |
| ISBN13 | 9781316636831 |
| Založniki | Cambridge University Press |
| Strani | 326 |
| Dimenzije | 151 × 227 × 18 mm · 492 g |
| Jezik | Angleščina |
Več od istega **izdajatelja**
Ogled vseh Williamson, David P. (Cornell University, New York) ( Na primer Hardcover Book in Paperback Book )