Sciweavers

ESA
2009
Springer
131views Algorithms» more  ESA 2009»
14 years 6 months ago
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
Abstract. We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of
Geevarghese Philip, Venkatesh Raman, Somnath Sikda...