A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is `application/pdf`

.

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

2013
*
Symposium on Theoretical Aspects of Computer Science
*

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. In other words, we give polynomial time algorithms that, for a given H-topological-minor free graph G and a positive integer k, output an Htopological-minor free graph G on O(k) vertices such that G has a (connected) dominating set of size k if and only if G has. Our results extend the known classes of graphs on which Dominating Set and Connected

doi:10.4230/lipics.stacs.2013.92
dblp:conf/stacs/FominLST13
fatcat:7xiyebshenbdrb7t6ihlnlldku