Povej prijatelju o tem izdelku:
Graph Colouring and the Probabilistic Method - Algorithms and Combinatorics Michael Molloy 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.
344 pages, biography
| Medij | Knjige Hardcover Book (Knjiga s trdim hrbtom in platnicami) |
| Izdano | 20. novembra 2001 |
| ISBN13 | 9783540421399 |
| Založniki | Springer-Verlag Berlin and Heidelberg Gm |
| Strani | 326 |
| Dimenzije | 155 × 235 × 20 mm · 635 g |
Mere med samme udgiver
Ogled vseh Michael Molloy ( Na primer Paperback Book , Book , Loose-leaf , Hardcover Book in Bound Book )