Kernel bounds for path and cycle problems

Hans L. Bodlaender, B.M.P. Jansen, Stefan Kratsch

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

11 Citations (Scopus)


Connectivity problems like k-Path and k-Disjoint Paths relate to many important milestones in parameterized complexity, namely the Graph Minors Project, color coding, and the recent development of techniques for obtaining kernelization lower bounds. This work explores the existence of polynomial kernels for various path and cycle problems, by considering nonstandard parameterizations. We show polynomial kernels when the parameters are a given vertex cover, a modulator to a cluster graph, or a (promised) max leaf number. We obtain lower bounds via cross-composition, e.g., for Hamiltonian Cycle and related problems when parameterized by a modulator to an outerplanar graph.

Original languageEnglish
Title of host publicationParameterized and Exact Computation - 6th International Symposium, IPEC 2011, Revised Selected Papers
Number of pages14
Publication statusPublished - 2012
Externally publishedYes
Event6th International Symposium on Parameterized and Exact Computation, IPEC 2011 - Saarbrucken, Germany
Duration: 6 Sept 20118 Sept 2011
Conference number: 6

Publication series

NameLecture Notes in Computer Science
ISSN (Print)03029743
ISSN (Electronic)16113349


Conference6th International Symposium on Parameterized and Exact Computation, IPEC 2011
Abbreviated titleIPEC 2011


Dive into the research topics of 'Kernel bounds for path and cycle problems'. Together they form a unique fingerprint.

Cite this