Faites connaître cet article à vos amis:
The Vertex Cover Algorithm Ashay Dharwadker
Prix
€ 19,99
Commandé depuis un entrepôt distant
Livraison prévue 19 août - 2 sept.
Recevez une notification pour les nouvelles sorties de Ashay Dharwadker
Nos clients disent :
Ajouter à votre liste de souhaits iMusic
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.
| Médias | Livres Paperback Book (Livre avec couverture souple et dos collé) |
| Validé | 2 octobre 2011 |
| ISBN13 | 9781466384477 |
| Éditeurs | CreateSpace Independent Publishing Platf |
| Pages | 44 |
| Dimensions | 216 × 279 × 3 mm · 131 g |
| Langue et grammaire | Anglais |
