Sciweavers

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

39

ICDCN
2011
Springer

favoriteEmaildiscussreport

180views Distributed and Parallel Com...» more ICDCN 2011»

Deterministic Dominating Set Construction in Networks with Bounded Degree

13 years 2 months ago

Deterministic Dominating Set Construction in Networks with Bounded Degree

Download www.cs.technion.ac.il

This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usually signiﬁcantly smaller than n, the total number of nodes in the system. Such networks arise in various settings of wireless and peer-to-peer communication. A trivial approach of choosing all nodes into the dominating set yields an algorithm

Roy Friedman, Alex Kogan

Real-time Traffic

Algorithm | Distributed And Parallel Computing | ICDCN 2011 | Maximal Degree | Node |

claim paper

Related Content

» Distributed algorithms for edge dominating sets

» Efficient Construction of WeaklyConnected Dominating Set for Clustering Wireless Ad Hoc Ne...

» Fast distributed algorithms for weakly connected dominating sets and linearsize skeletons

» Minimum Dominating Set Approximation in Graphs of Bounded Arboricity

» On Constructing kConnected kDominating Set in Wireless Networks

» An optimal maximal independent set algorithm for boundedindependence graphs

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

» Distributed Connected Dominating Set Construction in Geometric kDisk Graphs

» Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks

Post Info
More Details (n/a)

Added	29 Aug 2011
Updated	29 Aug 2011
Type	Journal
Year	2011
Where	ICDCN
Authors	Roy Friedman, Alex Kogan

Comments (0)