Gajarský, J. and Hlinený, P. and Obdrzálek, J. and Ordyniak, S. and Reidl, Felix and Rossmanith, P. and Sánchez Villaamil, F. and Sikdar, S. (2016) Kernelization using structural parameters on sparse graph classes. Journal of Computer and System Sciences 84 , pp. 219-242. ISSN 0022-0000.
|
Text
24775.pdf - Author's Accepted Manuscript Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (510kB) | Preview |
Abstract
We prove that graph problems with finite integer index have linear kernels on graphs of bounded expansion when parameterized by the size of a modulator to constant-treedepth graphs. For nowhere dense graph classes, our result yields almost-linear kernels. We also argue that such a linear kernelization result with a weaker parameter would fail to include some of the problems covered by our framework. We only require the problems to have FII on graphs of constant treedepth. This allows to prove linear kernels also for problems such as Longest-Path/Cycle, Exact- s, t -Path, Treewidth, and Pathwidth, which do not have FII on general graphs.
Metadata
| Item Type: | Article |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Felix Reidl |
| Date Deposited: | 26 Oct 2018 07:09 |
| Last Modified: | 09 Aug 2023 12:45 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/24755 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
