he problem of finding Minimum Vertex Cover for graph belongs to the class of NP Complete and plays a key role in Computer Science Theory. The problems which belong to NP Complete set are not solvable in polynomial time in any known way. Since finding Minimum Vertex Cover (MVC) for a graph belongs to NP Complete class; so we are dubious to solve it in any polynomial time algorithm. Such problems are solved by algorithms which promise to give near optimum solution. In this paper we have analyzed and scrutinized such algorithms like greedy algorithm, approximation algorithm, simple genetic algorithm (GA), primal-dual based algorithm (PDB), Alom's algorithm etc. on random directed and undirected graphs and found that all the algorithms give near optimum solution with a negligible performance difference. It was also observed that out of all the above said algorithms Alom's Algorithm is more effective in finding MVC for undirected graphs and for weighted graphs, superior performance is attained by primal-dual based approach.

/pdf/implementation-and-comparison-of-vertex-cover-problem-using-1vg0lacstj.pdf

Reshu Tyagi

Papers

Implementation and Comparison of Vertex Cover Problem using Various Techniques