124 research outputs found
Fractals for Kernelization Lower Bounds
The composition technique is a popular method for excluding polynomial-size
problem kernels for NP-hard parameterized problems. We present a new technique
exploiting triangle-based fractal structures for extending the range of
applicability of compositions. Our technique makes it possible to prove new
no-polynomial-kernel results for a number of problems dealing with
length-bounded cuts. In particular, answering an open question of Golovach and
Thilikos [Discrete Optim. 2011], we show that, unless NP coNP /
poly, the NP-hard Length-Bounded Edge-Cut (LBEC) problem (delete at most
edges such that the resulting graph has no - path of length shorter than
) parameterized by the combination of and has no
polynomial-size problem kernel. Our framework applies to planar as well as
directed variants of the basic problems and also applies to both edge and
vertex deletion problems. Along the way, we show that LBEC remains NP-hard on
planar graphs, a result which we believe is interesting in its own right.Comment: An extended abstract appeared in Proc. of the 43rd International
Colloquium on Automata, Languages, and Programming (ICALP 2016). A full
version will appear in SIAM Journal on Discrete Mathematics (SIDMA
The Graph Motif problem parameterized by the structure of the input graph
The Graph Motif problem was introduced in 2006 in the context of biological
networks. It consists of deciding whether or not a multiset of colors occurs in
a connected subgraph of a vertex-colored graph. Graph Motif has been mostly
analyzed from the standpoint of parameterized complexity. The main parameters
which came into consideration were the size of the multiset and the number of
colors. Though, in the many applications of Graph Motif, the input graph
originates from real-life and has structure. Motivated by this prosaic
observation, we systematically study its complexity relatively to graph
structural parameters. For a wide range of parameters, we give new or improved
FPT algorithms, or show that the problem remains intractable. For the FPT
cases, we also give some kernelization lower bounds as well as some ETH-based
lower bounds on the worst case running time. Interestingly, we establish that
Graph Motif is W[1]-hard (while in W[P]) for parameter max leaf number, which
is, to the best of our knowledge, the first problem to behave this way.Comment: 24 pages, accepted in DAM, conference version in IPEC 201
On group feedback vertex set parameterized by the size of the cutset
We study the parameterized complexity of a robust generalization of the
classical Feedback Vertex Set problem, namely the Group Feedback Vertex Set
problem; we are given a graph G with edges labeled with group elements, and the
goal is to compute the smallest set of vertices that hits all cycles of G that
evaluate to a non-null element of the group. This problem generalizes not only
Feedback Vertex Set, but also Subset Feedback Vertex Set, Multiway Cut and Odd
Cycle Transversal. Completing the results of Guillemot [Discr. Opt. 2011], we
provide a fixed-parameter algorithm for the parameterization by the size of the
cutset only. Our algorithm works even if the group is given as a
polynomial-time oracle
Reconfiguration on nowhere dense graph classes
Let be a vertex subset problem on graphs. In a reconfiguration
variant of we are given a graph and two feasible solutions
of with . The problem is
to determine whether there exists a sequence of feasible
solutions, where , , , and each
results from , , by the addition or removal of a single vertex.
We prove that for every nowhere dense class of graphs and for every integer
there exists a polynomial such that the reconfiguration
variants of the distance- independent set problem and the distance-
dominating set problem admit kernels of size . If is equal to the
size of a minimum distance- dominating set, then for any fixed
we even obtain a kernel of almost linear size . We
then prove that if a class is somewhere dense and closed under
taking subgraphs, then for some value of the reconfiguration variants
of the above problems on are -hard (and in
particular we cannot expect the existence of kernelization algorithms). Hence
our results show that the limit of tractability for the reconfiguration
variants of the distance- independent set problem and distance-
dominating set problem on subgraph closed graph classes lies exactly on the
boundary between nowhere denseness and somewhere denseness
Parameterized Algorithms for Deletion to (r,l)-graphs
For fixed integers , a graph is called an {\em
-graph} if the vertex set can be partitioned into
independent sets and cliques. This brings us to the following natural
parameterized questions: {\sc Vertex -Partization} and {\sc Edge
-Partization}. An input to these problems consist of a graph and
a positive integer and the objective is to decide whether there exists a
set () such that the deletion of from
results in an -graph. These problems generalize well studied
problems such as {\sc Odd Cycle Transversal}, {\sc Edge Odd Cycle Transversal},
{\sc Split Vertex Deletion} and {\sc Split Edge Deletion}. We do not hope to
get parameterized algorithms for either {\sc Vertex -Partization} or
{\sc Edge -Partization} when either of or is at least
as the recognition problem itself is NP-complete. This leaves the case of
. We almost complete the parameterized complexity dichotomy
for these problems. Only the parameterized complexity of {\sc Edge
-Partization} remains open. We also give an approximation algorithm and
a Turing kernelization for {\sc Vertex -Partization}. We use an
interesting finite forbidden induced graph characterization, for a class of
graphs known as -split graphs, properly containing the class of
-graphs. This approach to obtain approximation algorithms could be of
an independent interest
Kernelization Using Structural Parameters on Sparse Graph Classes
Meta-theorems for polynomial (linear) kernels have been the subject of
intensive research in parameterized complexity. Heretofore, meta-theorems for
linear kernels exist on graphs of bounded genus, -minor-free graphs, and
-topological-minor-free graphs. To the best of our knowledge, no
meta-theorems for polynomial kernels are known for any larger sparse graph
classes; e.g., for classes of bounded expansion or for nowhere dense ones. In
this paper we prove such meta-theorems for the two latter cases. More
specifically, we show that graph problems that have finite integer index (FII)
have linear kernels on graphs of bounded expansion when parameterized by the
size of a modulator to constant-treedepth graphs. For nowhere dense graph
classes, our result yields almost-linear kernels. While our parameter may seem
rather strong, we argue that a linear kernelization result on graphs of bounded
expansion with a weaker parameter (than treedepth modulator) would fail to
include some of the problems covered by our framework. Moreover, we only
require the problems to have FII on graphs of constant treedepth. This allows
us to prove linear kernels for problems such as Longest Path/Cycle, Exact
-Path, Treewidth, and Pathwidth, which do not have FII on general graphs
(and the first two not even on bounded treewidth graphs).Comment: A preliminary version appeared as an extended abstract in the
proceedings of ESA 2013, and one section in the proceedings of IPEC 2014.
Changes from the previous version: inclusion of the IPEC 2014 results; much
stronger conclusion for the case of nowhere dense graph classes; inclusion of
some additional problems in the framework, e.g., of the branchwidth proble
Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter
An important result in the study of polynomial-time preprocessing shows that
there is an algorithm which given an instance (G,k) of Vertex Cover outputs an
equivalent instance (G',k') in polynomial time with the guarantee that G' has
at most 2k' vertices (and thus O((k')^2) edges) with k' <= k. Using the
terminology of parameterized complexity we say that k-Vertex Cover has a kernel
with 2k vertices. There is complexity-theoretic evidence that both 2k vertices
and Theta(k^2) edges are optimal for the kernel size. In this paper we consider
the Vertex Cover problem with a different parameter, the size fvs(G) of a
minimum feedback vertex set for G. This refined parameter is structurally
smaller than the parameter k associated to the vertex covering number vc(G)
since fvs(G) <= vc(G) and the difference can be arbitrarily large. We give a
kernel for Vertex Cover with a number of vertices that is cubic in fvs(G): an
instance (G,X,k) of Vertex Cover, where X is a feedback vertex set for G, can
be transformed in polynomial time into an equivalent instance (G',X',k') such
that |V(G')| <= 2k and |V(G')| <= O(|X'|^3). A similar result holds when the
feedback vertex set X is not given along with the input. In sharp contrast we
show that the Weighted Vertex Cover problem does not have a polynomial kernel
when parameterized by the cardinality of a given vertex cover of the graph
unless NP is in coNP/poly and the polynomial hierarchy collapses to the third
level.Comment: Published in "Theory of Computing Systems" as an Open Access
publicatio
Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help?
We prove a number of results around kernelization of problems parameterized
by the size of a given vertex cover of the input graph. We provide three sets
of simple general conditions characterizing problems admitting kernels of
polynomial size. Our characterizations not only give generic explanations for
the existence of many known polynomial kernels for problems like q-Coloring,
Odd Cycle Transversal, Chordal Deletion, Eta Transversal, or Long Path,
parameterized by the size of a vertex cover, but also imply new polynomial
kernels for problems like F-Minor-Free Deletion, which is to delete at most k
vertices to obtain a graph with no minor from a fixed finite set F.
While our characterization captures many interesting problems, the
kernelization complexity landscape of parameterizations by vertex cover is much
more involved. We demonstrate this by several results about induced subgraph
and minor containment testing, which we find surprising. While it was known
that testing for an induced complete subgraph has no polynomial kernel unless
NP is in coNP/poly, we show that the problem of testing if a graph contains a
complete graph on t vertices as a minor admits a polynomial kernel. On the
other hand, it was known that testing for a path on t vertices as a minor
admits a polynomial kernel, but we show that testing for containment of an
induced path on t vertices is unlikely to admit a polynomial kernel.Comment: To appear in the Journal of Computer and System Science
On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be
made bipartite (i.e., 2-colorable) by deleting at most l vertices. We study
structural parameterizations of OCT with respect to their polynomial
kernelizability, i.e., whether instances can be efficiently reduced to a size
polynomial in the chosen parameter. It is a major open problem in parameterized
complexity whether Odd Cycle Transversal admits a polynomial kernel when
parameterized by l. On the positive side, we show a polynomial kernel for OCT
when parameterized by the vertex deletion distance to the class of bipartite
graphs of treewidth at most w (for any constant w); this generalizes the
parameter feedback vertex set number (i.e., the distance to a forest).
Complementing this, we exclude polynomial kernels for OCT parameterized by the
distance to outerplanar graphs, conditioned on the assumption that NP \not
\subseteq coNP/poly. Thus the bipartiteness requirement for the treewidth w
graphs is necessary. Further lower bounds are given for parameterization by
distance from cluster and co-cluster graphs respectively, as well as for
Weighted OCT parameterized by the vertex cover number (i.e., the distance from
an independent set).Comment: Accepted to IPEC 2011, Saarbrucke
Exploiting Dense Structures in Parameterized Complexity
Over the past few decades, the study of dense structures from the perspective of approximation algorithms has become a wide area of research. However, from the viewpoint of parameterized algorithm, this area is largely unexplored. In particular, properties of random samples have been successfully deployed to design approximation schemes for a number of fundamental problems on dense structures [Arora et al. FOCS 1995, Goldreich et al. FOCS 1996, Giotis and Guruswami SODA 2006, Karpinksi and Schudy STOC 2009]. In this paper, we fill this gap, and harness the power of random samples as well as structure theory to design kernelization as well as parameterized algorithms on dense structures. In particular, we obtain linear vertex kernels for Edge-Disjoint Paths, Edge Odd Cycle Transversal, Minimum Bisection, d-Way Cut, Multiway Cut and Multicut on everywhere dense graphs. In fact, these kernels are obtained by designing a polynomial-time algorithm when the corresponding parameter is at most ?(n). Additionally, we obtain a cubic kernel for Vertex-Disjoint Paths on everywhere dense graphs. In addition to kernelization results, we obtain randomized subexponential-time parameterized algorithms for Edge Odd Cycle Transversal, Minimum Bisection, and d-Way Cut. Finally, we show how all of our results (as well as EPASes for these problems) can be de-randomized
- …