Results 11  20
of
133,129
The Price of Connectivity for Vertex Cover
, 2013
"... The vertex cover number of a graph is the minimum number of vertices that are needed to cover all edges. When those vertices are further required to induce a connected subgraph, the corresponding number is called the connected vertex cover number, and is always greater or equal to the vertex cover n ..."
Abstract
 Add to MetaCart
The vertex cover number of a graph is the minimum number of vertices that are needed to cover all edges. When those vertices are further required to induce a connected subgraph, the corresponding number is called the connected vertex cover number, and is always greater or equal to the vertex cover
The vertexcover polynomial of a graph
 DISCRETE MATHEMATICS
, 2002
"... In this paper we define the vertexcover polynomial (G; ) for a graph G. The coefficient ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
In this paper we define the vertexcover polynomial (G; ) for a graph G. The coefficient
Vertex Cover: Further Observations and Further Improvements
 Journal of Algorithms
, 1999
"... Recently, there have been increasing interests and progresses in lowering the worst case time complexity for wellknown NPhard problems, in particular for the Vertex Cover problem. In this paper, new properties for the Vertex Cover problem are indicated and several simple and new techniques are int ..."
Abstract

Cited by 187 (19 self)
 Add to MetaCart
Recently, there have been increasing interests and progresses in lowering the worst case time complexity for wellknown NPhard problems, in particular for the Vertex Cover problem. In this paper, new properties for the Vertex Cover problem are indicated and several simple and new techniques
Vertex cover approximations: Experiments and observations
, 2005
"... Abstract. The vertex cover problem is a classic NPcomplete problem for which the best worstcase approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, each of which guarantees an approximation ratio of 3 2, to find approximate vertex covers for a large collecti ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. The vertex cover problem is a classic NPcomplete problem for which the best worstcase approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, each of which guarantees an approximation ratio of 3 2, to find approximate vertex covers for a large
Vertex Cover Approximations on Random Graphs.
"... Abstract. The vertex cover problem is a classical NPcomplete problem for which the best worstcase approximation ratio is 2 − o(1). In this paper, we use a collection of simple graph transformations, each of which guarantees an approximation ratio of 3, to find approximate vertex covers for a large ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. The vertex cover problem is a classical NPcomplete problem for which the best worstcase approximation ratio is 2 − o(1). In this paper, we use a collection of simple graph transformations, each of which guarantees an approximation ratio of 3, to find approximate vertex covers for a
Parameterized complexity of generalized vertex cover problems
 In Proc. 9th WADS, volume 3608 of LNCS
, 2005
"... Abstract. Important generalizations of the Vertex Cover problem ..."
Abstract

Cited by 27 (3 self)
 Add to MetaCart
Abstract. Important generalizations of the Vertex Cover problem
CONNECTED VERTEX COVERS IN DENSE GRAPHS
"... Abstract. We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in dense graphs, in which either the minimum or the average degree is linear. In particular, we prove tight parame ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in dense graphs, in which either the minimum or the average degree is linear. In particular, we prove tight
Results 11  20
of
133,129