How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?

DOI10.1007/s00453-018-0468-8zbMath1430.68126arXiv1609.08095MaRDI QIDQ2324243

Marin Bougeret, Ignasi Sau

Publication date: 10 September 2019

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

treewidth; parameterized complexity; sparse graphs; structural parameters; polynomial kernels; treedepth

Mathematics Subject Classification ID

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

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

68Q27: Parameterized complexity, tractability and kernelization