Gajarsky, J., Hlineny, P., Obdrzalek, J. et al. (5 more authors) (2017) Kernelization using structural parameters on sparse graph classes. Journal of Computer and System Sciences, 84. pp. 219-242. ISSN 0022-0000
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--Path, Treewidth, and Pathwidth, which do not have FII on general graphs.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2017 Elsevier. This is an author produced version of a paper subsequently published in Journal of Computer and System Sciences. Uploaded in accordance with the publisher's self-archiving policy. Article available under the terms of the CC-BY-NC-ND licence (https://creativecommons.org/licenses/by-nc-nd/4.0/). |
Keywords: | Parameterized complexity; Kernelization; Nowhere dense graphs; Finite integer index; Treedepth |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 15 May 2018 08:57 |
Last Modified: | 15 May 2018 15:16 |
Published Version: | https://doi.org/10.1016/j.jcss.2016.09.002 |
Status: | Published |
Publisher: | Elsevier |
Refereed: | Yes |
Identification Number: | 10.1016/j.jcss.2016.09.002 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:130764 |