3 search results - page 1 / 1 » Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolat... |
ESA
2007
Springer
13 years 10 months ago
2007
Springer
SODA
2003
ACM
13 years 6 months ago
2003
ACM
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...