articole
(gol)
Contact
Cont 
This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the...
citește totul
This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the minimum coloring.
ascunde descrierea- Editură: ISTE Ltd and John Wiley & Sons Inc
- Cod:
- Anul publicării: 2006
- Limba: Engleză
- Legarea: Legată
- Număr de pagini: 267
- Lățimea ambalajului: 24.3 cm
- Înălțimea ambalajului: 16.1 cm
- Adâncimea ambalajului: 2 cm
- Greutatea ambalajului: 532 g
Recenzii