Nemokamas pristatymas nuo 29€

  • check 10 + milijonai knygų
  • check Naujienos (kiekvieną dieną)
  • check 1 + mln. klientų mus pasitiki
  • check Geros kainos % Nuolaidos
  • check Nemokamas pristatymas nuo 29 eur

The Independent Set Algorithm - Ashay Dharwadker

Anglų
2006-08-08
17,22 € 26,49 €

-35% su kodu BOOKS

Turime sandėlyje pas mūsų tiekėją

Pristatymas per 10-16 d.d.

30 dienų grąžinimo politika

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 ... Visas aprašymas

Jums taip pat gali patikti

Aprašymas

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.

Daugiau informacijos

Autorius Ashay Dharwadker
Leidėjas Institute of Mathematics
Išleidimo metai 2006
Viršelio tipas Minkšti viršeliai
EAN 9781466387690
Parašykite savo atsiliepimą
Jūs peržiūrėjote: The Independent Set Algorithm
Jūsų įvertinimas:

Goodreads Atsiliepimai

17,22 € 26,49 €