Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation

Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal. Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation. In Guy E. Blelloch, Kunal Agrawal, editors, Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015. pages 182-191, ACM, 2015. [doi]

Abstract

Abstract is missing.