Povej prijatelju o tem izdelku:
Network Flow Algorithms Williamson, David P. (Cornell University, New York)
Naročeno iz oddaljenega skladišča
Kaj pravijo naše stranke:
Na voljo tudi kot:
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 Hardcover Book (Knjiga s trdim hrbtom in platnicami) |
| Izdano | 5. septembra 2019 |
| ISBN13 | 9781107185890 |
| Založniki | Cambridge University Press |
| Strani | 326 |
| Dimenzije | 236 × 158 × 17 mm · 586 g |
| Jezik | Angleščina |
Več od Williamson, David P. (Cornell University, New York)
Prikaži vse
Več od istega **izdajatelja**
Ogled vseh Williamson, David P. (Cornell University, New York) ( Na primer Hardcover Book in Paperback Book )