๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Approximation Algorithms for Connected Dominating Sets

โœ Scribed by S. Guha; S. Khuller

Publisher
Springer
Year
1998
Tongue
English
Weight
140 KB
Volume
20
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Rainbow connection number and connected
Rainbow connection number and connected dominating sets
โœ L. Sunil Chandran; Anita Das; Deepak Rajendraprasad; Nithin M. Varma ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 167 KB

## Abstract The __rainbow connection number__ of a connected graph is the minimum number of colors needed to color its edges, so that every pair of its vertices is connected by at least one path in which no two edges are colored the same. In this article we show that for every connected graph on __

Maintaining weakly-connected dominating
Maintaining weakly-connected dominating sets for clustering ad hoc networks
โœ Yuanzhu Peter Chen; Arthur L. Liestman ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 424 KB

An ad hoc network is a multihop wireless communication network supporting mobile users. Network performance degradation is a major problem as the network becomes larger. Clustering is an approach to simplify the network structure and thus alleviate the scalability problem. One method that has been p