Results 1  10
of
1,079,963
Optimization of Unweighted Minimum Vertex Cover
, 2010
"... 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 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
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
Applying Genetic Algorithm to the Minimum Vertex Cover Problem
"... Let G = (V, E) be a simple undirected graph. The Minimum Vertex Cover (MVC) problem is to find a minimum subset C of V such that for every edge, at least one of its endpoints should be included in C. Like many other graph theoretic problems this problem is also known to be NPhard. In this paper, we ..."
Abstract
 Add to MetaCart
Let G = (V, E) be a simple undirected graph. The Minimum Vertex Cover (MVC) problem is to find a minimum subset C of V such that for every edge, at least one of its endpoints should be included in C. Like many other graph theoretic problems this problem is also known to be NPhard. In this paper
On minimum vertex cover of generalized Petersen graphs
, 2006
"... Determining the size of minimum vertex cover of a graph G, denoted by β(G), is an NPcomplete problem. Also, for only few families of graphs, β(G) is known. We study the size of minimum vertex cover in generalized Petersen graphs. For each n and k (n>2k), a generalized Petersen graph P (n, k), is ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Determining the size of minimum vertex cover of a graph G, denoted by β(G), is an NPcomplete problem. Also, for only few families of graphs, β(G) is known. We study the size of minimum vertex cover in generalized Petersen graphs. For each n and k (n>2k), a generalized Petersen graph P (n, k
An Approximation of the Minimum Vertex Cover in a Graph
 Japan J. Indust. Appl. Math
, 1998
"... For a given undirected graph G with n vertices and m edges, we present an approximation algorithm for the minimum vertex cover problem. Our algorithm nds a vertex cover within 2 8m 13n 2 +8m of the optimal size in O(nm) time. Key words: graph, vertex cover, matching, cycle, approximation algorit ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
For a given undirected graph G with n vertices and m edges, we present an approximation algorithm for the minimum vertex cover problem. Our algorithm nds a vertex cover within 2 8m 13n 2 +8m of the optimal size in O(nm) time. Key words: graph, vertex cover, matching, cycle, approximation
An Evolutionary Heuristic for the Minimum Vertex Cover Problem
 KI94 Workshops (Extended Abstracts
, 1994
"... this paper, are used to compare the behavior of the genetic algorithm with the vercov heuristic. Recall that these graphs contain n = 3k + 4 (k 1) nodes distributed on three levels. They can be scaled up by choosing high values for k. We choose problem instances of the regular graph of sizes n = 10 ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
this paper, are used to compare the behavior of the genetic algorithm with the vercov heuristic. Recall that these graphs contain n = 3k + 4 (k 1) nodes distributed on three levels. They can be scaled up by choosing high values for k. We choose problem instances of the regular graph of sizes n = 100 (k = 32) and n = 202 (k = 66). For each of the problems a total of N = 100 independent runs of the vercov heuristic is performed, and the results are summarized in table 2. The same experiments were also performed for graphs of size n = 200 in order to test the behavior of the genetic algorithm as well as the vercov heuristic for an even larger problem size. In this case, the genetic algorithm was allowed to run for 4 \Delta 10
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
 International Symposium on Algorithms and Computation, vol.1969 of Lect. Notes in Comput. Sci., pp.132–143
, 2000
"... It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant less than 2. In this paper, we study the Vertex Cover problem on graphs with perfect matching (shortly, VCPM). We show th ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant less than 2. In this paper, we study the Vertex Cover problem on graphs with perfect matching (shortly, VCPM). We show
Cellular learning automata based algorithm for solving minimum vertex cover problem
 in 2014 22nd Iranian Conference on Electrical Engineering (ICEE
"... Abstract — The minimum vertex cover of a given graph G is a set of vertices such that every vertex in G belongs either to the set or adjacent to vertices of the covering set. Finding the minimum vertex cover in an arbitrary graph is NPComplete and several approximation algorithms have been proposed ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract — The minimum vertex cover of a given graph G is a set of vertices such that every vertex in G belongs either to the set or adjacent to vertices of the covering set. Finding the minimum vertex cover in an arbitrary graph is NPComplete and several approximation algorithms have been
Hybrid Evolutionary Algorithms on Minimum Vertex Cover for Random Graphs
, 2007
"... This paper analyzes the hierarchical Bayesian optimization algorithm (hBOA) on minimum vertex cover for standard classes of random graphs and transformed SAT instances. The performance of hBOA is compared with that of the branchandbound problem solver (BB), the simple genetic algorithm (GA) and th ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
This paper analyzes the hierarchical Bayesian optimization algorithm (hBOA) on minimum vertex cover for standard classes of random graphs and transformed SAT instances. The performance of hBOA is compared with that of the branchandbound problem solver (BB), the simple genetic algorithm (GA
Results 1  10
of
1,079,963