Fortæl dine venner om denne vare:
Graph Colouring and the Probabilistic Method - Algorithms and Combinatorics Michael Molloy Softcover reprint of the original 1st ed. 2002 edition
Har du en konto? Log ind
Modtag notifikation om nye Michael Molloy udgivelser
Tilføj til din iMusic ønskeseddel
eller
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.
| Medie | Bøger Paperback Bog (Bog med blødt omslag og limet ryg) |
| ISBN13 | 9783642040153 |
| Forlag | Springer-Verlag Berlin and Heidelberg Gm |
| Antal sider | 326 |
| Mål | 150 × 220 × 10 mm · 491 g (Estimeret vægt) |
| Sprog | Engelsk |