Kernel Bounds for Structural Parameterizations of Pathwidth

@article{Bodlaender2012KernelBF,
  title={Kernel Bounds for Structural Parameterizations of Pathwidth},
  author={Hans L. Bodlaender and Bart M. P. Jansen and Stefan Kratsch},
  journal={ArXiv},
  year={2012},
  volume={abs/1207.4900}
}
Assuming the AND-distillation conjecture, the Pathwidth problem of determining whether a given graph G has pathwidth at most k admits no polynomial kernelization with respect to k. The present work studies the existence of polynomial kernels for Pathwidth with respect to other, structural, parameters. Our main result is that, unless NP ⊆ coNP/poly, Pathwidth admits no polynomial kernelization even when parameterized by the vertex deletion distance to a clique, by giving a cross-composition… 

Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization

This work seeks to prove rigorous performance guarantees for such preprocessing rules---known rules as well as more recent ones---by studying them in the framework of kernelization from parameterized complexity.

FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders

This work shows how exponential-size minor-minimal obstructions for pathwidth k form the crucial ingredient in a novel or-cross-compositions for k-Pathwidth, complementing the trivial and-composition that is known for this problem.

Preprocessing subgraph and minor problems: When does a small vertex cover help?

These characterizations not only give generic explanations for the existence of many known polynomial kernels for problems like q-Coloring, Odd Cycle Transversal, Chordal Deletion, @h-Transversal or Long Path, parameterized by the size of a vertex cover, but also imply new polynometric kernels for Problems like F-Minor-Free Deletions.

Uniform Kernelization Complexity of Hitting Forbidden Minors

It is proved that some Planar F-Minor-Free Deletion problems do not have uniformly polynomial kernels (unless NP ⊆ coNP/poly), not even when parameterized by the vertex cover number.

Kernelization Using Structural Parameters on Sparse Graph Classes

This paper shows that graph problems that have finite integer index (FII) admit linear kernels on hereditary graphs of bounded expansion when parameterized by the size of a modulator to constant-treedepth graphs, and proves meta-theorems for these three graph classes.

The Power of Data Reduction : Kernels for Fundamental Graph Problems

The concept of kernelization, developed within the field of parameterized complexity theory, is used to give a mathematical analysis of the power of data reduction for dealing with fundamental NP-hard graph problems and it is proved that Treewidth and Pathwidth do not admit polynomial kernels parameterized by the vertex-deletion distance to a clique, unless thePolynomial hierarchy collapses.

On Cutwidth Parameterized by Vertex Cover

This work gives the first non-trivial exact exponential time algorithm for Cutwidth on a graph class where the problem remains NP-complete and shows that Cutwidth parameterized by the size of the minimum vertex cover of the input graph does not admit a polynomial kernel unless NP⊆coNP/poly.

Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth

A branch-and-bound algorithm that computes the exact pathwidth of graphs and a corresponding path decomposition and achieves good performance when used as a heuristic (i.e., when returning best result found within bounded time limit).

Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth

A Branch and Bound algorithm that computes the exact pathwidth of graphs and a corresponding path-decomposition and achieves good performance when used as a heuristic (i.e., when returning best result found within bounded time-limit).

References

SHOWING 1-10 OF 21 REFERENCES

Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization

This work seeks to prove rigorous performance guarantees for such preprocessing rules---known rules as well as more recent ones---by studying them in the framework of kernelization from parameterized complexity.

Cross-Composition: A New Technique for Kernelization Lower Bounds

It is shown that if an NP-hard problem cross-composes into a parameterized problem Q then Q does not admit a polynomial kernel unless thePolynomial hierarchy collapses, and its applicability is shown by proving kernelization lower bounds for a number of important graphs problems with structural (non-standard) parameterizations.

Complexity of finding embeddings in a k -tree

This work determines the complexity status of two problems related to finding the smallest number k such that a given graph is a partial k-tree and presents an algorithm with polynomially bounded (but exponential in k) worst case time complexity.

New Lower and Upper Bounds for Graph Treewidth

New lower and upper bounds for the treewidth are proposed and tested on the well known DIMACS benchmark for graph coloring, and the heuristic method computes good bounds within a very small computing time.

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.

Graph minors. I. Excluding a forest

On problems without polynomial kernels

The Vertex Separation and Search Number of a Graph

Algorithms that, for any tree T, compute vs ( T ) in linear time and compute an optimal layout with respect to vertex separation in time O ( n log n) are given.

On the Pathwidth of Chordal Graphs

A Partial k-Arboretum of Graphs with Bounded Treewidth

  • H. Bodlaender
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 1998