Košík
zboží
(prázdné)
Kontakt
Účet
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...
číst celé
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.
schovat popis
- Nakladatel: Cambridge University Press
- Kód:
- Rok vydání: 2019
- Jazyk: Angličtina
- Vazba: Taschenbuch
- Počet stran: 326
- Šířka balení: 15.1 cm
- Výška balení: 22.7 cm
- Hloubka balení: 1.8 cm
- Váha balení: 492 g
Recenze