Pastāsti draugiem par šo preci:
Graph Colouring and the Probabilistic Method - Algorithms and Combinatorics Michael Molloy Softcover reprint of the original 1st ed. 2002 edition
Graph Colouring and the Probabilistic Method - Algorithms and Combinatorics
Michael Molloy
Over the past decade, many major advances have been made in the field of graph coloring via the probabilistic method. This monograph, by two of the best on the topic, provides an accessible and unified treatment of these results, using tools such as the Lovasz Local Lemma and Talagrand's concentration inequality.
326 pages, XIV, 326 p.
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| ISBN13 | 9783642040153 |
| Izdevēji | Springer-Verlag Berlin and Heidelberg Gm |
| Lapas | 326 |
| Izmēri | 150 × 220 × 10 mm · 491 g (Svars (aptuveni)) |
| Valoda | Angļu |
Vairāk no Michael Molloy
Rādīt visuMere med samme udgiver
Skatīt visus Michael Molloy ( piem., Paperback Book , Book , Loose-leaf , Hardcover Book un Bound Book )