Conte aos seus amigos sobre este item:
The Vertex Cover Algorithm Ashay Dharwadker
Preço
€ 19,99
Item sob encomenda (no estoque do fornecedor)
Data prevista de entrega 5 - 19 de jun
O que dizem nossos clientes:
Adicione à sua lista de desejos do 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ídia | Livros Paperback Book (Livro de capa flexível e brochura) |
| Lançado | 2 de outubro de 2011 |
| ISBN13 | 9781466384477 |
| Editoras | CreateSpace Independent Publishing Platf |
| Páginas | 44 |
| Dimensões | 216 × 279 × 3 mm · 131 g |
| Idioma | Inglês |
