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

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



PDF
Thumbnail PDF

File

LIPIcs.STACS.2013.92.pdf
  • Filesize: 0.79 MB
  • 12 pages

Document Identifiers

Author Details

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

Cite AsGet BibTex

Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Dimitrios M. Thilikos. Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 92-103, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
https://doi.org/10.4230/LIPIcs.STACS.2013.92

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.
Keywords
  • Parameterized complexity
  • kernelization
  • algorithmic graph minors
  • dominating set
  • connected dominating set

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail