%0 Journal Article %A S. Balaji and V. Swaminathan and K. Kannan %D 2010 %J International Journal of Mathematical and Computational Sciences %B World Academy of Science, Engineering and Technology %I Open Science Index 43, 2010 %T Optimization of Unweighted Minimum Vertex Cover %U https://publications.waset.org/pdf/12686 %V 43 %X The Minimum Vertex Cover (MVC) problem is a classic graph optimization NP - complete problem. In this paper a competent algorithm, called Vertex Support Algorithm (VSA), is designed to find the smallest vertex cover of a graph. The VSA is tested on a large number of random graphs and DIMACS benchmark graphs. Comparative study of this algorithm with the other existing methods has been carried out. Extensive simulation results show that the VSA can yield better solutions than other existing algorithms found in the literature for solving the minimum vertex cover problem. %P 941 - 946