Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation
ACM Symposium on Parallelism in Algorithms and Architectures, 2015.
We develop a novel parallel decomposition strategy for unweighted, undirected graphs, based on growing disjoint connected clusters from batches of centers progressively selected from yet uncovered nodes. With respect to similar previous decompositions, our strategy exercises a tighter control on both the number of clusters and their maxim...More
PPT (Upload PPT)