Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels

14 years 7 months ago

Abstract. We show that the k-Dominating Set problem is ﬁxed parameter tractable (FPT) and has a polynomial kernel for any class of

Geevarghese Philip, Venkatesh Raman, Somnath Sikda

Algorithms | ESA 2009 | K-dominating Set Problem | Polynomial Kernel |

claim paper

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	ESA
Authors	Geevarghese Philip, Venkatesh Raman, Somnath Sikdar

Comments (0)