Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization

DOI10.1137/120903518zbMath1290.05143WikidataQ59567517 ScholiaQ59567517MaRDI QIDQ5408612

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

Publication date: 10 April 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/120903518

zbMATH Keywords

treewidth; parameterized complexity; kernelization; preprocessing

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W05: Nonnumerical algorithms

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)