License: Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2013.92
URN: urn:nbn:de:0030-drops-39255
URL: https://drops.dagstuhl.de/opus/volltexte/2013/3925/
Go to the corresponding LIPIcs Volume Portal


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

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

pdf-format:
13.pdf (0.8 MB)


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.

BibTeX - Entry

@InProceedings{fomin_et_al:LIPIcs:2013:3925,
  author =	{Fedor V. Fomin and Daniel Lokshtanov and Saket Saurabh and Dimitrios M. Thilikos},
  title =	{{Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs}},
  booktitle =	{30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)},
  pages =	{92--103},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-50-7},
  ISSN =	{1868-8969},
  year =	{2013},
  volume =	{20},
  editor =	{Natacha Portier and Thomas Wilke},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2013/3925},
  URN =		{urn:nbn:de:0030-drops-39255},
  doi =		{10.4230/LIPIcs.STACS.2013.92},
  annote =	{Keywords: Parameterized complexity, kernelization, algorithmic graph minors, dominating set, connected dominating set}
}

Keywords: Parameterized complexity, kernelization, algorithmic graph minors, dominating set, connected dominating set
Collection: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)
Issue Date: 2013
Date of publication: 26.02.2013


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI