The Applicability of Genetic algorithm to Vertex Cover

Harsh Bhasin, Mohammad Amini
2015 International Journal of Computer Applications  
The Vertex Cover Problem calls for the selection of a set of vertices(V) in a way that all the edges of the graph, connected to those vertices constitute the set E of the given graph G= (V, E). The problem finds applications in various fields and is therefore, one of the most widely researched topics in NP Complete Problems. The problem is an NP Complete problem this work proposes a Genetic Algorithm based solution to handle the problem. The proposed algorithm has been implemented and tested
more » ... various graphs. These instances vary in the number of vertices and connectivity. The results are encouraging. This paper also explores the available techniques in order to put the things in the perspective. The future scope of this work intends to apply Diploid Genetic Algorithms to the problem to incorporate robustness into the proposed algorithm.
doi:10.5120/ijca2015905785 fatcat:zbv7b2nl7jb4loo26kbb6ri5ha