Complexity of network synchronization
Journal of the ACM (JACM)
Improved distributed algorithms for coloring and network decomposition problems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Locality in distributed graph algorithms
SIAM Journal on Computing
Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
New sparseness results on graph spanners
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
On sparse spanners of weighted graphs
Discrete & Computational Geometry
On local representations of graphs and networks
On local representations of graphs and networks
Online tracking of mobile users
Journal of the ACM (JACM)
Fast distributed network decompositions and covers
Journal of Parallel and Distributed Computing
Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
SIAM Journal on Computing
Near-Linear Time Construction of Sparse Neighborhood Covers
SIAM Journal on Computing
Graph relabelling systems and distributed algorithms
Handbook of graph grammars and computing by graph transformation
Simple and efficient network decomposition and synchronization
Theoretical Computer Science
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Information Processing Letters
SIAM Journal on Computing
Low Complexity Network Synchronization
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Distributing the Execution of a Distributed Algorithm over a Network
IV '03 Proceedings of the Seventh International Conference on Information Visualization
Approximate distance oracles for unweighted graphs in Õ (n2) time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
$(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
SIAM Journal on Computing
New constructions of (α, β)-spanners and purely additive spanners
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the locality of bounded growth
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Distributive graph algorithms Global solutions from local data
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Network decomposition and locality in distributed computation
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
A simple linear time algorithm for computing a (2k - 1)-spanner of o(n1+1/k) size in weighted graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Fast deterministic distributed maximal independent set computation on growth-bounded graphs
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Fast deterministic distributed algorithms for sparse spanners
Theoretical Computer Science
Latency-optimal walks in replicated and partitioned graphs
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
Fast deterministic distributed algorithms for sparse spanners
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Improving large graph processing on partitioned graphs in the cloud
Proceedings of the Third ACM Symposium on Cloud Computing
Deterministic distributed construction of linear stretch spanners in polylogarithmic time
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
This paper presents efficient deterministic and randomized distributed algorithms for decomposing a graph with n nodes into a disjoint set of connected clusters with small radius and few intercluster edges. Our algorithms can be easily implemented in the distributed CONGEST model of computation i.e., limited message size, improving the time complexity of previous algorithms [27, 3, 29] from linear to sublinear. One important application of our algorithms is efficient construction of sparse graph spanners. In fact, given a parameter k, we show that there exists a sublinear deterministic distributed algorithm that constructs a graph spanner of stretch 2k-1 with at most O(n1+1/k) edges in the CONGEST model.