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.
| ISBN: | 9783642040153 |
| Publication date: | 4th December 2002 |
| Author: | Michael Molloy, Bruce Reed |
| Publisher: | Springer an imprint of Springer Berlin Heidelberg |
| Format: | Paperback |
| Pagination: | 326 pages |
| Series: | Algorithms and Combinatorics |
| Genres: |
Probability and statistics Maths for computer scientists Stochastics Mathematical and statistical software Algorithms and data structures Mathematical theory of computation Combinatorics and graph theory Computer science |
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.
Graph Colouring and the Probabilistic Method features in the following genres: Probability and statistics, Maths for computer scientists, Stochastics, Mathematical and statistical software, Algorithms and data structures, Mathematical theory of computation, Combinatorics and graph theory, Computer science
Paperback. Not Available.
Graph Colouring and the Probabilistic Method was written by Michael Molloy, Bruce Reed and published by Springer an imprint of Springer Berlin Heidelberg
Graph Colouring and the Probabilistic Method has 326 pages
Yes it is part of Algorithms and Combinatorics series