Fortell venner om denne varen:
Graph Colouring and the Probabilistic Method - Algorithms and Combinatorics Michael Molloy Softcover reprint of the original 1st ed. 2002 edition
Har du en profil? Logg inn
Legg til iMusic ønskeliste
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.
| Media | Bøker Pocketbok (Bok med mykt omslag og limt rygg) |
| ISBN13 | 9783642040153 |
| Utgivere | Springer-Verlag Berlin and Heidelberg Gm |
| Antall sider | 326 |
| Mål | 150 × 220 × 10 mm · 491 g (Estimert vekt) |
| Språk | Engelsk |
Mer med Michael Molloy
Vis alleMere med samme udgiver
Se alt med Michael Molloy ( f.eks. Pocketbok , Bok , Løsblad , Innbunden bok og Innbunden bok )