Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks

Yuanzhu Peter Chen, Arthur L. Liestman. Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. In Proceedings of the 3rd ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2002, June 9-11, 2002, Lausanne, Switzerland. pages 165-172, ACM, 2002. [doi]

Authors

Yuanzhu Peter Chen

This author has not been identified. Look up 'Yuanzhu Peter Chen' in Google

Arthur L. Liestman

This author has not been identified. Look up 'Arthur L. Liestman' in Google