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 Vertex Cover 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 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 ... Pilns apraksts

Jums varētu patikt arī

Aprašymas

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.

Vairāk informācijas

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

Goodreads atsauksmes

17,03 € 24,33 €