Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs

Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We give the first linear kernels for Dominating Set and Connected Dominating Set problems on graphs excluding a fixed graph H as a topological minor.

Original languageEnglish (US)
Title of host publication30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013
Pages92-103
Number of pages12
DOIs
StatePublished - 2013
Event30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013 - Kiel, Germany
Duration: Feb 27 2013Mar 2 2013

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume20
ISSN (Print)1868-8969

Conference

Conference30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013
Country/TerritoryGermany
CityKiel
Period2/27/133/2/13

Keywords

  • Algorithmic graph minors
  • Connected dominating set
  • Dominating set
  • Kernelization
  • Parameterized complexity

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs'. Together they form a unique fingerprint.

Cite this