International Journal of Innovative Technology and Exploring Engineering (IJITEE)
The Vertex Cover (VC) problem belongs to the class of Non deterministic Polynomial time Complete (NPC) graph theoretical problems, which plays a central role in theoretical computer science and it has a numerous real life applications. Since the problem is Non deterministic Polynomial time Complete (NPC) it is unlikely to find a polynomial-time algorithm for solving vertex-cover problem exactly. This paper analyses the various algorithms to find minimum vertex cover for standard classes of random graph. The performance of all algorithms is compared with the complexity and the output solution that of the approximation algorithm, clever greedy algorithm, branch-and-bound algorithm, and simple Genetic Algorithm (GA).