Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
From MaRDI portal
Publication:4962217
DOI10.1145/2797140zbMath1398.68245arXiv1207.0835MaRDI QIDQ4962217
Christophe Paul, Ignasi Sau, Felix Reidl, Peter Rossmanith, Somnath Sikdar, Eun Jung Kim, Alexander Langer
Publication date: 30 October 2018
Published in: ACM Transactions on Algorithms, Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.0835
algorithmic meta-theorems; parameterized complexity; sparse graphs; graph minors; linear kernels; hitting minors; single-exponential algorithms
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C83: Graph minors
05C85: Graph algorithms (graph-theoretic aspects)