Tell your friends about this item:
Graph Colouring and the Probabilistic Method - Algorithms and Combinatorics 2002 edition
Michael Molloy
Graph Colouring and the Probabilistic Method - Algorithms and Combinatorics 2002 edition
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
Media | Books Hardcover Book (Book with hard spine and cover) |
Released | November 20, 2001 |
ISBN13 | 9783540421399 |
Publishers | Springer-Verlag Berlin and Heidelberg Gm |
Pages | 326 |
Dimensions | 155 × 235 × 20 mm · 635 g |
Show all
More by Michael Molloy
See all of Michael Molloy ( e.g. Paperback Book , Book , Bound Book , Hardcover Book and Loose-leaf )