Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

ESA
2009
Springer

favoriteEmaildiscussreport

131views Algorithms» more ESA 2009»

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

13 years 11 months ago

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

Download www.imsc.res.in

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

Real-time Traffic

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

claim paper

Related Content

» Linear kernels for connected dominating set on Hminorfree graphs

» On the Kernelization Complexity of Colorful Motifs

» The effect of girth on the kernelization complexity of Connected Dominating Set

» Bidimensionality and Kernels

» Subexponential Algorithms for Partial Cover Problems

» The Complexity Ecology of Parameters An Illustration Using Bounded Max Leaf Number

Post Info
More Details (n/a)

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

Comments (0)