Bezmaksas piegāde pasūtījumiem virs 29€

  • check 10+ miljoni grāmatu
  • check Jaunumi katru dienu
  • check Vairāk nekā 1 miljons klientu mums uzticas
  • check Labas cenas un atlaides
  • check Piegāde visā Eiropā

The Clique Algorithm - Ashay Dharwadker

angļu valoda
2006-08-08
17,03 € 24,33 €

-30% ar kodu BOOKS

Piegādātāja noliktavā

Piegāde 10-16 darba dienu laikā

30 dienu atgriešanas politika

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 maximum clique in all known examples of graphs. In view of the importance of the P versus NP question, we ask if there exists a graph for which the algor ... Pilns apraksts

Jums varētu patikt arī

Aprašymas

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 maximum clique in all known examples of graphs. In view of the importance of the P versus NP question, we ask if there exists a graph for which the algorithm cannot find a maximum clique. The algorithm is demonstrated by finding maximum cliques for several famous graphs, including two large benchmark graphs with hidden maximum cliques. We implement the algorithm in C++ and provide a demonstration program for Microsoft Windows.

Vairāk informācijas

Autors Ashay Dharwadker
Izdevējs Institute of Mathematics
Izlaides gads 2006
Vāka tips Mīkstais vāks
EAN 9781466391215
Rakstiet savu atsauksmi
Jūs vērtējat: The Clique Algorithm
Jūsu novērtējums:

Goodreads atsauksmes

17,03 € 24,33 €