Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

The Independent Set Algorithm - Ashay Dharwadker

inglise keel
2006-08-08
14,60 € 24,33 €

-40% koodiga BOOKS

Meie tarnija laos

Saadetis 10-16 tööpäeva jooksul

30-päevane tagastamisõigus

We present a new polynomial-time algorithm for finding maximal independent sets 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 independent set in all known examples of graphs. In view of the importance of the P versus NP question, we ask if there exists a graph f ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

We present a new polynomial-time algorithm for finding maximal independent sets 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 independent set 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 independent set. The algorithm is demonstrated by finding maximum independent sets for several famous graphs, including two large benchmark graphs with hidden maximum independent sets. We implement the algorithm in C++ and provide a demonstration program for Microsoft Windows.

Lisateave

Autor Ashay Dharwadker
Kirjastaja Institute of Mathematics
Väljalaskeaasta 2006
Kaanetüüp Pehme kaanega
EAN 9781466387690
Kirjuta oma arvustus
Te vaatate: The Independent Set Algorithm
Teie hinnang:

Goodreads'i arvustused

14,60 € 24,33 €