Sciweavers

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

26

JDA
2006

favoriteEmaildiscussreport

59views more JDA 2006»

A note on the complexity of minimum dominating set

13 years 11 months ago

A note on the complexity of minimum dominating set

Download www.dsi.uniroma1.it

The currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n nodes is the trivial (2n) algorithm which enumerates and checks all the subsets of

Fabrizio Grandoni

Real-time Traffic

Fastest Algorithm | JDA 2006 |

claim paper

Related Content

» New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks

» Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks

» Clustering wireless ad hoc networks with weakly connected dominating set

» Messageoptimal connected dominating sets in mobile ad hoc networks

» Distributed Approximation of Capacitated Dominating Sets

» The Parameterized Complexity of Some Minimum Label Problems

» An exact algorithm for minimum CDS with shortest path constraint in wireless networks

» Approximation Algorithms for Domination Search

» On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JDA
Authors	Fabrizio Grandoni

Comments (0)