Tell your friends about this item:
Graph Colouring and the Probabilistic Method - Algorithms and Combinatorics Michael Molloy Softcover reprint of the original 1st ed. 2002 edition
Do you have a profile? Log in
Christmas presents can be returned until 31 January
Our customers say:
Add to your iMusic wish list
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.
| Media | Books Paperback Book (Book with soft cover and glued back) |
| ISBN13 | 9783642040153 |
| Publishers | Springer-Verlag Berlin and Heidelberg Gm |
| Pages | 326 |
| Dimensions | 150 × 220 × 10 mm · 491 g (Weight (estimated)) |
| Language | English |
More by Michael Molloy
Show all
See all of Michael Molloy ( e.g. Paperback Book , Book , Hardcover Book , Bound Book and Loose-leaf )