Minimum connected dominating sets and maximal independent sets in unit disk graphs
Authors:
- Weili WuWWWeili Wu
- Hongwei DuHDHongwei Du
- Xiaohua JiaXJXiaohua Jia
- Yingshu LiYLYingshu Li
- Scott C.-H. HuangSHScott C.-H. Huang
- 1 March 2006
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 352 (1-3) , 1-7
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor NetworksJournal of Global Optimization, 2006
- Internal nodes based broadcasting in wireless networks2005
- A greedy approximation for minimum connected dominating setsTheoretical Computer Science, 2004
- A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networksNetworks, 2003
- Geometric spanners for wireless ad hoc networksIEEE Transactions on Parallel and Distributed Systems, 2003
- Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks2002
- Message-optimal connected dominating sets in mobile ad hoc networks2002
- Power efficient topologies for wireless sensor networks2001
- On calculating connected dominating set for efficient routing in ad hoc wireless networks1999
- MBONE: the multicast backboneCommunications of the ACM, 1994