Computational analysis of different vertex cover algorithms of various graphs

Various Solutions for Vertex Cover algorithms are available in the world which are from NP-Complete class. There are several real world applications of Vertex Cover algorithm like different networks as Terrorist communication n/w, Wireless communication n/w, Airline communication n/w. We are representing the comparative analysis of various subsisting algorithms like Approximation algorithm, List(s) algorithm, Greedy technique and Alom's algorithm for the Vertex Cover problem in this paper. From the analysis, we came to know that the Alom's algorithm is giving optimized result among all Vertex Cover algorithms of every graph having large number of nodes where the Approximation algorithm gives the worst response of the execution for huge graphs.