A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F}\)-minor-free deletion

DOI10.1007/978-3-030-30786-8_9zbMath1477.68131arXiv1906.05565OpenAlexW2972399708MaRDI QIDQ2301538

Huib Donkers, Bart M. P. Jansen

Publication date: 24 February 2020

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

zbMATH Keywords

Turing kernelizationstructural parameterizationminor-free deletionsubgraph-free deletion

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

On some FPT problems without polynomial Turing compressions

This page was built for publication: A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F}\)-minor-free deletion