An Optimized Algorithm for Vertex cover Problem

Abstract

The Vertex Cover problem is one of the NP-Complete Graph problems. It has dominant role in the computer science and various real time applications like, Airline Communication Network, Network Traffic Measurement, and Terrorist Communication Network etc. Among all Approximation algorithm, some algorithms have been recommended to minimize the vertex cover problem. But not all of them should be complete or optimal. So in order to get near optimal solution we are going to propose a new algorithm that should give a near optimal solution for the given graph. The graphs which are going to be considered for vertex cover problem should be large in size so to process the graph through modified vertex cover problem parallel approach should be used to get the Vertex Cover separately.