Hitting forbidden subgraphs in graphs of bounded treewidth

  title={Hitting forbidden subgraphs in graphs of bounded treewidth},
  author={Marek Cygan and D{\'a}niel Marx and Marcin Pilipczuk and Michal Pilipczuk},
  booktitle={Information and Computation},

Figures from this paper

Hitting forbidden induced subgraphs on bounded treewidth graphs

The smallest function $f_H(t)$ such that H-IS-Deletion can be solved in time is determined assuming the Exponential Time Hypothesis (ETH), and it is shown that when $H$ deviates slightly from a clique, the function suffers a sharp jump.

Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus

It is proved that, assuming the counting version of the Strong Exponential-Time Hypothesis (#SETH), the problem of counting perfect matchings • has no (2 --- e)knO(1) time algorithm for any e > 0 on graphs of treewidth k (but it can be solved in time O(nk+1) if a k-expression is given).

Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth

A matching lower bound is given giving evidence that double-exponential dependence on treewidth may be necessary for the choosability problem, and evidence that an algorithm with running time 2^(2^(o(w)))*n^(O(1)) would violate the Exponential-Time Hypothesis (ETH).

Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization

This work proves for every fixed non-interval graph H that if a tree decomposition of width tw(G) is given in the input, then the problem can be solved in time i^*(H)^{tw(G)} n^{O(1)}.

Parameterized Graph Modification Algorithms

This thesis shows that editing towards trivially perfect graphs, threshold graphs, and chain graphs are all NP-complete, resolving 15 year old open questions and provides several new results in classical complexity, kernelization complexity, and subexponential parameterized complexity.

Close relatives (of Feedback Vertex Set), revisited

A common theme of the first two algorithmic results is to represent connectivity properties of the current graph in a state of a dynamic programming algorithm as an auxiliary forest with O(k) nodes, resulting in a 2O(k log k) bound on the number of states for one node of the tree decomposition or cliquewidth expression.

Reducing graph transversals via edge contractions

This work proves co-NP-hardness results under some assumptions on the graphs in ${\cal H}$, which implies that Contraction ($\pi$) is co- NP-hard even for fixed $k=d=1$ when $\pi$ is the size of a minimum feedback vertex set or an odd cycle transversal.

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs

It is proved that the problem of finding a largest, in terms of the number of vertices, induced subgraph of a graph G that belongs to $\mathcal{C}$ can be solved in $2^{o(n)$ time.

Proportionally Fair Matching with Multiple Groups

This work designs exact and approximation algorithms achieving reasonable guarantees on the quality of the matching as well as on the time complexity of proportionally fair matching with more than two groups.



Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

It is shown that the aforementioned gap cannot be breached for some problems that aim to maximize the number of connected components like Cycle Packing, and in several cases it is able to show that improving those constants would cause the Strong Exponential Time Hypothesis to fail.

Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth

Two new approaches rooted in linear algebra, based on matrix rank and determinants, which provide deterministic c tw | V | O ( 1 ) time algorithms, also for weighted and counting versions of connectivity problems are presented.

On Bounded-Degree Vertex Deletion parameterized by treewidth

A linear time algorithm for finding tree-decompositions of small treewidth

Every minor-closed class of graphs that does not contain all planar graphs has a linear time recognition algorithm that determines whether the treewidth of G is at most k, and if so, finds a treedecomposition of G withtreewidth at mostK.

Incompressibility through Colors and IDs

This paper shows how to combine results with combinatorial reductions which use colors and IDs in order to prove kernelization lower bounds for a variety of basic problems, and rules out the existence of compression algorithms for many of the problems in question.

A Near-Optimal Planarization Algorithm

A dynamic programming algorithm for Weighted Vertex Planarization on graphs of treewidth w with running time 2O(w log w) · n, thereby improving over previous double-exponential algorithms.

Known algorithms on graphs of bounded treewidth are probably optimal

Lower bounds on the running time of algorithms solving problems on graphs of bounded treewidth are obtained and the results under the Strong Exponential Time Hypothesis of Impagliazzo and Paturi are proved.

An O(c^k n) 5-Approximation Algorithm for Treewidth

This is the first algorithm providing a constant factor approximation for tree width which runs in time single-exponential in k and linear in n, and can be used to speed up many such algorithms to work in time which is single-Exponential in the tree width andlinear in the input size.

Treewidth, Computations and Approximations

  • T. Kloks
  • Mathematics
    Lecture Notes in Computer Science
  • 1994
Testing superperfection of k-trees and triangulating 3-colored graphs results in approximating treewidth and pathwidth for some classes of perfect graphs.