✦ LIBER ✦

Constructing weakly connected dominating set for

✍ Scribed by Hongjie Du; Weili Wu; Shan Shan; Donghyun Kim; Wonjun Lee

Publisher: Springer US
Year: 2010
Tongue: English
Weight: 356 KB
Volume: 23
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-010-9358-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation Algorithms for Steiner Con

Approximation Algorithms for Steiner Connected Dominating Set

✍ Ya-Feng Wu; Yin-Long Xu; Guo-Liang Chen 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 299 KB

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

Distributed fault tolerant computation o

Distributed fault tolerant computation of weakly connected dominating set in ad hoc networks

✍ Zhenyu Xu; James Wang; Pradip K. Srimani 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 530 KB

A new distributed approximation algorith

A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks

✍ Bo Gao; Yuhang Yang; Huiye Ma 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 516 KB

Solving Connected Dominating Set Faster

Solving Connected Dominating Set Faster than 2n

✍ Fedor V. Fomin; Fabrizio Grandoni; Dieter Kratsch 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 371 KB

Approximation Algorithms for Connected D

Approximation Algorithms for Connected Dominating Sets

✍ S. Guha; S. Khuller 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 140 KB