Kód: 17063051
We present a new polynomial-time algorithm for finding maximal cliques in graphs. As a corollary, we obtain new bounds on the famous Ramsey numbers in terms of the maximum and minimum vertex degrees of the corresponding Ramsey gra ... celý popis
Angličtina
14.07 €
Bežne: 15.18 €
Ušetríte 1.12 €

Nákupom získate 34 bodov
Anotácia knihy
We present a new polynomial-time algorithm for finding maximal cliques in graphs. As a corollary, we obtain new bounds on the famous Ramsey numbers in terms of the maximum and minimum vertex degrees of the corresponding Ramsey graphs. The algorithm finds a
Parametre knihy
14.07 €
AngličtinaOsobný odber Bratislava a 12742 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk Všetky práva vyhradenéSúkromieCookies
24 miliónov titulov
Vrátenie do mesiaca
02/210 210 99 (8-15.30h)Nákupný košík ( prázdny )
Nachádzate sa: