The Vertex Cover Algorithm

Name: The Vertex Cover Algorithm
Rating: 5 (1 reviews)

Ashay Dharwadker

2006년 8월 · Institute of Mathematics

5.0

리뷰 1개

eBook

페이지

검증되지 않은 평점과 리뷰입니다. 자세히 알아보기

eBook 정보

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.

평점 및 리뷰

5.0

리뷰 1개

저자 정보

Ashay Dharwadker is the Distinguished Professor of Mathematics & Natural Sciences at the Institute of Mathematics, Gurgaon, India. He is the author of a dozen exquisitely illustrated books describing his fundamental contributions to combinatorics, graph theory, computer science and the foundations of physics.