Recomienda este artículo a tus amigos:
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
| Medios de comunicación | Libros Hardcover Book (Libro con lomo y cubierta duros) |
| Publicado | 5 de septiembre de 2019 |
| ISBN13 | 9781107185890 |
| Editores | Cambridge University Press |
| Páginas | 326 |
| Dimensiones | 236 × 158 × 17 mm · 586 g |
| Lengua | Inglés |