• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
The Vertex Cover Algorithm

The Vertex Cover Algorithm

Paperback

General Computers

ISBN10: 1466384476
ISBN13: 9781466384477
Publisher: Createspace
Published: Oct 2 2011
Pages: 46
Weight: 0.29
Height: 0.12 Width: 8.50 Depth: 11.00
Language: English
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.

Also in

General Computers