Results 1 
3 of
3
Fast Distributed Network Decompositions and Covers
 Journal of Parallel and Distributed Computing
, 1996
"... This paper presents deterministic sublineartime distributed algorithms for network decomposition and for constructing a sparse neighborhood cover of a network. The latter construction leads to improved distributed preprocessing time for a number of distributed algorithms, including allpairs shorte ..."
Abstract

Cited by 29 (4 self)
 Add to MetaCart
This paper presents deterministic sublineartime distributed algorithms for network decomposition and for constructing a sparse neighborhood cover of a network. The latter construction leads to improved distributed preprocessing time for a number of distributed algorithms, including allpairs shortest paths computation, load balancing, broadcast, and bandwidth management. A preliminary version of this paper appeared in the Proceedings of the Eleventh Annual ACM Symposium on the Principles of Distributed Computing. y Lab. for Computer Science, MIT, Cambridge, MA 02139. Supported by Air Force Contract AFOSR F4962092J0125, NSF contract 9114440CCR, DARPA contracts N0001491J1698 and N00014J921799, and a special grant from IBM. z Dept. of Mathematics and Lab. for Computer Science, MIT. Supported in part by an NSF Postdoctoral Research Fellowship and an ONR grant provided to the Radcliffe Bunting Institute. x Dept. of Math Sciences, Johns Hopkins University, Baltimore, MD 21...
Parallel graph decomposition using random shifts
 In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA
, 2013
"... We show an improved parallel algorithm for decomposing an undirected unweighted graph into small diameter pieces with a small fraction of the edges in between. These decompositions form critical subroutines in a number of graph algorithms. Our algorithm builds upon the shifted shortest path approach ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
We show an improved parallel algorithm for decomposing an undirected unweighted graph into small diameter pieces with a small fraction of the edges in between. These decompositions form critical subroutines in a number of graph algorithms. Our algorithm builds upon the shifted shortest path approach introduced in [Blelloch,Gupta,Koutis,Miller,Peng,Tangwongsan, SPAA 2011]. By combining various stages of the previous algorithm, we obtain a significantly simpler algorithm with the same asymptotic guarantees as the best sequential algorithm. 1
Efficient SelfOrganization Of Large Wireless Sensor Networks
, 2004
"... Wireless sensor (and actuator) networks have critical applications in industrial, scientific, medical, and military domains. Envisioned applications require large networks consisting of hundreds, thousands, or even millions of inexpensive wireless sensor nodes with bandwidth and energy constraints. ..."
Abstract
 Add to MetaCart
Wireless sensor (and actuator) networks have critical applications in industrial, scientific, medical, and military domains. Envisioned applications require large networks consisting of hundreds, thousands, or even millions of inexpensive wireless sensor nodes with bandwidth and energy constraints. Distributed selforganization, which involves network decomposition into connected clusters, is a fundamental problem in this environment.