áru
(üres)
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...
tovább
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.
leírás elrejtése
- Kiadó: Cambridge University Press
- Kód:
- Kiadás éve: 2019
- Nyelv: Angol
- Kötés: Fűzött (paperback)
- Oldalak száma: 326
- Csomag szélessége: 15.1 cm
- Csomag magassága: 22.7 cm
- Csomag mélysége: 1.8 cm
- Csomag súlya: 492 g
Recenzió