Graph Colouring and the Probabilistic Method - Algorithms and Combinatorics - Michael Molloy - Grāmatas - Springer-Verlag Berlin and Heidelberg Gm - 9783642040153 -
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

Graph Colouring and the Probabilistic Method - Algorithms and Combinatorics Softcover reprint of the original 1st ed. 2002 edition


Saņemt e-pastu, kad prece būs pieejama
Do you have a profile? Pierakstīties
Pievienot savam iMusic vēlmju sarakstam

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.

Mediji Grāmatas     Paperback Book   (Grāmata ar mīksto vāku un līmēto muguru)
ISBN13 9783642040153
Izdevēji Springer-Verlag Berlin and Heidelberg Gm
Lapas 326
Izmēri 150 × 220 × 10 mm   ·   491 g   (Svars (aptuveni))
Valoda Angļu  

Vairāk no Michael Molloy

Rādīt visu

Mere med samme udgiver