Paper Title :A Novel Algorithm to Solve Vertex Cover Problem
Author :Gurleen Singh, Geetanjali Sharma & Prabhdeep Singh
Article Citation :Gurleen Singh ,Geetanjali Sharma & Prabhdeep Singh ,
(2013 ) " A Novel Algorithm to Solve Vertex Cover Problem " ,
International Journal of Advance Computational Engineering and Networking (IJACEN) ,
pp. 60-66,
Volume-1,Issue-1
Abstract : Vertex cover problem relates to real time application as in any routing algorithm to find a router that controls
whole path which is defined by vertex cover problem only. Vertex Cover contains phases of covering and non-covering
edges. There are various Polynomial time algorithms designed for vertex cover problem but it is bit difficult to find any
perfect polynomial time algorithms. Greedy, Clever Greedy, Genetic and Alom Algorithms are analysed in this paper and
Comparison among these algorithms is also shown and shows that Alom algorithm is performed better then all algorithms
with respect to performance and complexity. There are some problems exists in Alom Algorithm which are to be improved
so a new algorithm is proposedfor vertex cover problem which can work efficiently then Alom algorithm in case of
performance and complexity.
Type : Research paper
Published : Volume-1,Issue-1
DOIONLINE NO - IJACEN-IRAJ-DOIONLINE-11
View Here
Copyright: © Institute of Research and Journals
| |
 |
| |
 |
PDF |
| |
Viewed - 27 |
| |
Published on 2014-01-17 |
|
