TY - JFULL
AU - S. Balaji and V. Swaminathan and K. Kannan
PY - 2010/8/
TI - Optimization of Unweighted Minimum Vertex Cover
T2 - International Journal of Mathematical and Computational Sciences
SP - 940
EP - 946
EM - balaji_maths@yahoo.com, sulanesri@yahoo.com, kkannan@maths.sastra.edu
VL - 4
SN - 1307-6892
UR - http://waset.org/publications/12686
PU - World Academy of Science, Engineering and Technology
NX - International Science Index 43, 2010
N2 - 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.
ER -