A greedy approach based algorithm for the vertex cover problem
Sushil Chandra Dimri, Kamlesh Chandra Purohit, Durgesh Pant · 2013
The vertex cover problem is NP complete problem; we use approximation algorithms to find near optimal solution of the vertex cover problem. In this paper we are presenting a greedy algorithm for finding a near optimal cover for a given graph G = (V, E).The development of the algorithm is based on greedy approach and the graph is represented in form of its adjacency matrix. The proposed algorithm finds a minimum vertex cover in all known examples of graphs.