Graph Colouring and the Probabilistic Method - Algorithms and Combinatorics - Michael Molloy - Books - Springer-Verlag Berlin and Heidelberg Gm - 9783540421399 - November 20, 2001
In case cover and title do not match, the title is correct

Graph Colouring and the Probabilistic Method - Algorithms and Combinatorics 2002 edition

Michael Molloy

Price
A$ 283.49

Ordered from remote warehouse

Expected delivery Feb 6 - 19
Add to your iMusic wish list

Graph Colouring and the Probabilistic Method - Algorithms and Combinatorics 2002 edition

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