Complexity of network synchronization
Journal of the ACM (JACM)
Decomposing graphs into regions of small diameter
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
A Graph-Theoretic Game and its Application to the $k$-Server Problem
SIAM Journal on Computing
A randomized parallel algorithm for single-source shortest paths
Journal of Algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
SIAM Journal on Computing
Shallow excluded minors and improved graph decompositions
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Polylog-time and near-linear work approximation scheme for undirected shortest paths
Journal of the ACM (JACM)
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Probability and statistics with reliability, queuing and computer science applications
Probability and statistics with reliability, queuing and computer science applications
Low-Diameter Graph Decomposition is in NC
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
Faster approximate lossy generalized flow via interior point algorithms
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Network decomposition and locality in distributed computation
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
SIAM Journal on Computing
Nearly Tight Low Stretch Spanning Trees
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Breaking the Multicommodity Flow Barrier for O(vlog n)-Approximations to Sparsest Cut
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Using petal-decompositions to build a low stretch spanning tree
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Direction-optimizing breadth-first search
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
| Hi-index | 0.00 |
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.