On sparsification for computing treewidth

DOI10.1007/s00453-014-9924-2zbMath1312.68103arXiv1308.3665MaRDI QIDQ2343087

Bart M. P. Jansen

Publication date: 4 May 2015

Published in: Algorithmica, Parameterized and Exact Computation (Search for Journal in Brave)

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

zbMATH Keywords

treewidth; lower bounds; sparsification; kernelization

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)