A GA based Approach to Find Minimal Vertex Cover
نویسندگان
چکیده
Genetic Algorithms are a class of Optimization Techniques which has been developed under inspiration of the Darwinian Theory of Survival of the Fittest. This technique has been successfully used to solve many optimization problems which otherwise pose huge challenges for computation. This paper presents a GA based approach to solve the Minimal Vertex Cover problem of Graph Theory.
منابع مشابه
On the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملVertex-cover in random graphs with small connectivity: an exact solution
We consider the vertex-cover problem on a finite-connectivity random graph with N vertices and connectivity c. For c smaller than 1/e, we prove that the cardinality of the minimal vertex cover is given by [1 W(c)(2 + W(c))/ 2 c] N + o(N), where W is the Lambert W function, as obtained by Hartmann and Weigt, [1], using the replica approach. The result is obtained in a very simple way and it is b...
متن کاملApproximation Algorithm for N-distance Minimal Vertex Cover Problem
Evolution of large scale networks demand for efficient way of communication in the networks. One way to propagate information in the network is to find vertex cover. In this paper we describe a variant of vertex cover problem naming it N-distance Vertex Minimal Cover(N-MVC) Problem to optimize information propagation throughout the network. A minimum subset of vertices of a unweighted and undir...
متن کاملHard Constrained Vertex-Cover Communication Algorithm for WSN
The communication problem is to select a minimal set of placed sensor devices in a service area so that the entire service area is accessible by the minimal set of sensors. Finding the minimal set of sensors is modeled as a vertex-cover problem, where the vertex-cover set facilitates the communications between the sensors in a multi-hop fashion keeping in mind the limited communication range an...
متن کاملSome Results on Forgotten Topological Coindex
The forgotten topological coindex (also called Lanzhou index) is defined for a simple connected graph G as the sum of the terms du2+dv2 over all non-adjacent vertex pairs uv of G, where du denotes the degree of the vertex u in G. In this paper, we present some inequalit...
متن کامل