Your Cart 
The Vertex Cover Algorithm

List Price: $15.00

Add to Cart

The Vertex Cover Algorithm

Authored by 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.

Publication Date:
1466384476 / 9781466384477
Page Count:
Binding Type:
US Trade Paper
Trim Size:
8.5" x 11"
Full Color
Related Categories:
Computers / Computer Science

Site Help Order Help Policies Contact