Kernelization using structural parameters on sparse graph classes

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

Metadata

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:
  • Published: March 2017
  • Published (online): 8 October 2016
  • Accepted: 9 September 2016
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: https://doi.org/10.1016/j.jcss.2016.09.002
Related URLs:

Download

Filename: main.pdf

Licence: CC-BY-NC-ND 4.0

Share / Export

Statistics