Freunden von diesem Artikel berichten:
The Vertex Cover Algorithm
Ashay Dharwadker
Bestellware
The Vertex Cover Algorithm
Ashay Dharwadker
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.
Medien | Bücher Taschenbuch (Buch mit Softcover und geklebtem Rücken) |
Erscheinungsdatum | 2. Oktober 2011 |
ISBN13 | 9781466384477 |
Verlag | CreateSpace Independent Publishing Platf |
Seitenanzahl | 44 |
Maße | 216 × 279 × 3 mm · 131 g |
Sprache | Englisch |
Weitere Titel von Ashay Dharwadker
Alle Titel von Ashay Dharwadker ansehen ( u. a. Taschenbuch )