Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
Data Structures and Algorithms
2009-05-15 v3
Abstract
We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of graphs that exclude K_{i,j} as a subgraph, for any fixed i, j >= 1. This strictly includes every class of graphs for which this problem has been previously shown to have FPT algorithms and/or polynomial kernels. In particular, our result implies that the problem restricted to bounded- degenerate graphs has a polynomial kernel, solving an open problem posed by Alon and Gutner.
Cite
@article{arxiv.0903.4521,
title = {Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels},
author = {Geevarghese Philip and Venkatesh Raman and Somnath Sikdar},
journal= {arXiv preprint arXiv:0903.4521},
year = {2009}
}
Comments
12 pages, 1 figure, 1 table