Kernel Bounds for Structural Parameterizations of Pathwidth

DOI10.1007/978-3-642-31155-0_31zbMath1357.68078arXiv1207.4900OpenAlexW3101261387WikidataQ59567547 ScholiaQ59567547MaRDI QIDQ2904570

Stefan Kratsch, Bart M. P. Jansen, Hans L. Bodlaender

Publication date: 14 August 2012

Published in: Algorithm Theory – SWAT 2012 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.4900

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (9)

Uniform Kernelization Complexity of Hitting Forbidden Minors ⋮ Treewidth and pathwidth parameterized by the vertex cover number ⋮ Preprocessing subgraph and minor problems: when does a small vertex cover help? ⋮ Unnamed Item ⋮ On cutwidth parameterized by vertex cover ⋮ FPT is characterized by useful obstruction sets ⋮ On structural parameterizations for the 2-club problem ⋮ On sparsification for computing treewidth ⋮ Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth

This page was built for publication: Kernel Bounds for Structural Parameterizations of Pathwidth