Results 1  10
of
569
Hitting forbidden minors: Approximation and kernelization
 IN PROCEEDINGS OF THE 8TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2011
"... We study a general class of problems called FDeletion problems. In an FDeletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such that the resulting graph does not contain as a minor any graph from the family F of forbidden minors. We obtain a number o ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
of algorithmic results on the FDeletion problem when F contains a planar graph. We give • a linear vertex kernel on graphs excluding tclaw K1,t, the star with t leves, as an induced subgraph, where t is a fixed integer. • an approximation algorithm achieving an approximation ratio of O(log 3/2 OPT), where OPT
Planarization and acyclic colorings of subcubic clawfree graphs
"... Abstract. We study methods of planarizing and acyclically coloring clawfree subcubic graphs. We give a polynomialtime algorithm that, given such a graph G, produces an independent set Q of at most n/6 vertices whose removal from G leaves an induced planar subgraph P (in fact, P has treewidth at mo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We study methods of planarizing and acyclically coloring clawfree subcubic graphs. We give a polynomialtime algorithm that, given such a graph G, produces an independent set Q of at most n/6 vertices whose removal from G leaves an induced planar subgraph P (in fact, P has treewidth
The Rank Facets Of The Stable Set Polytope For ClawFree Graphs
 J. COMB. THEORY B
, 1994
"... This paper provides a complete characterization of all the rank facets of the stable set polytope STAB(G) associated with a clawfree graph G. In particular, it is shown that a clawfree graph G produces a rank facet of STAB(G) if and only if it can be obtained by means of two simple lifting procedu ..."
Abstract

Cited by 17 (4 self)
 Add to MetaCart
This paper provides a complete characterization of all the rank facets of the stable set polytope STAB(G) associated with a clawfree graph G. In particular, it is shown that a clawfree graph G produces a rank facet of STAB(G) if and only if it can be obtained by means of two simple lifting
Finding Maximum Induced Matchings in Subclasses of ClawFree and P5Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size
, 2003
"... In a graph G a matching is a set of edges in which no two edges have a common endpoint. An induced matching is a matching in which no two edges are linked by an edge of G. The maximum induced matching (abbreviated MIM) problem is to find the maximum size of an induced matching for a given graph G. ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
. This problem is known to be NPhard even on bipartite graphs or on planar graphs. We present a polynomial time algorithm which given a graph G either finds a maximum induced matching in G, or claims that the size of a maximum induced matching in G is strictly less than the size of a maximum matching in G. We
Kernelization and Sparseness: the case of Dominating Set∗
, 2014
"... The search for linear kernels for the Dominating Set problem on classes of graphs of a topological nature has been one of the leading trends in kernelization in recent years. Following the fundamental work of Alber et al. [2] that established a linear kernel for the problem on planar graphs, linear ..."
Abstract
 Add to MetaCart
The search for linear kernels for the Dominating Set problem on classes of graphs of a topological nature has been one of the leading trends in kernelization in recent years. Following the fundamental work of Alber et al. [2] that established a linear kernel for the problem on planar graphs, linear
Results 1  10
of
569