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 Vertex Cover 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 minimal vertex covers in graphs. The algorithm finds a minimum vertex cover 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 minimum vertex cover. The algorithm is demonstrated by finding minimum vertex covers for several famous graphs, including ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

We present a new polynomial-time algorithm for finding minimal vertex covers in graphs. The algorithm finds a minimum vertex cover 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 minimum vertex cover. The algorithm is demonstrated by finding minimum vertex covers for several famous graphs, including two large benchmark graphs with hidden minimum vertex covers. 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 9781466384477
Kirjuta oma arvustus
Te vaatate: The Vertex Cover Algorithm
Teie hinnang:

Goodreads'i arvustused

14,60 € 24,33 €