Sciweavers

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

11

TAMC
2009
Springer

favoriteEmaildiscussreport

141views Applied Computing» more TAMC 2009»

Linear Kernel for Planar Connected Dominating Set

13 years 11 months ago

Linear Kernel for Planar Connected Dominating Set

Download www.ii.uib.no

We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set problem. To obtain the desired kernel we introduce a method that we call reduce or reﬁne. Our kernelization algorithm analyzes the input graph and either ﬁnds an appropriate reduction rule that can be applied, or zooms in on a region of the graph which is more amenable to reduction. We ﬁnd this method of independent interest and believe that it will be useful to obtain linear kernels for other problems on planar graphs.

Daniel Lokshtanov, Matthias Mnich, Saket Saurabh

Real-time Traffic

Applied Computing | Connected Dominating Set | Planar Graphs | Reduction Rule | TAMC 2009 |

claim paper

Related Content

» Linear Problem Kernels for NPHard Problems on Planar Graphs

» Linear kernels for connected dominating set on Hminorfree graphs

» Polynomial Time Data Reduction for Dominating Set

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

» Maximum kChains in Planar Point Sets Combinatorial Structure and Algorithms

» Meta Kernelization

» Messageoptimal connected dominating sets in mobile ad hoc networks

» Dominating Set Based Bluetooth Scatternet Formation with Localized Maintenance

» On the Small Cycle Transversal of Planar Graphs

Post Info
More Details (n/a)

Added	27 May 2010
Updated	27 May 2010
Type	Conference
Year	2009
Where	TAMC
Authors	Daniel Lokshtanov, Matthias Mnich, Saket Saurabh

Comments (0)