Kernelization Lower Bounds by Cross-Composition

DOI10.1137/120880240zbMath1295.05222arXiv1206.5941WikidataQ59567471 ScholiaQ59567471MaRDI QIDQ4979840

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

Publication date: 19 June 2014

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

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

zbMATH Keywords

parameterized complexity; kernelization; structural parameterization; kernel lower bounds

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)