Kaikki kirjat 25 % alennuksella koodilla: BOOKS

  • check Yli 10 miljoonaa kirjaa
  • check Uutuuksia joka päivä
  • check Yli 1 miljoona asiakasta luottaa meihin
  • check Hyvät hinnat ja alennukset
  • check Toimitus koko Eurooppaan

The Independent Set Algorithm - Ashay Dharwadker

englanti
2006-08-08
18,19 € 24,25 €

-25% koodilla BOOKS

Toimittajalla varastossa

Toimitus 10-16 arkipäivässä

30 päivän palautusoikeus

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äydellinen kuvaus

Saatat myös pitää

Kuvaus

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.

Lisätietoja

Kirjoittaja Ashay Dharwadker
Julkaisija Institute of Mathematics
Julkaisuvuosi 2006
Kannen tyyppi Pehmeäkantinen
EAN 9781466387690
Kirjoita oma arvostelusi
Arvostelet: The Independent Set Algorithm
Arvostelusi:

Goodreads-arvostelut

18,19 € 24,25 €