3.8 Proceedings Paper

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

Publisher

ASSOC COMPUTING MACHINERY
DOI: 10.1145/2755573.2755591

Keywords

Parallel Graph Algorithms; Graph Decomposition; k-Center Problem; Diameter Approximation; MapReduce

Funding

  1. NSF [IIS-124758]
  2. MIUR of Italy under project AMANDA
  3. University of Padova [CPDA121378/12]

Ask authors/readers for more resources

We develop a novel parallel decomposition strategy for un-weighted, 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 maximum radius. We present two important applications of our parallel graph decomposition: (1) k-center clustering approximation; and (2) diameter approximation. In both cases, we obtain algorithms which feature a polylogarithmic approximation factor and are amenable to a distributed implementation that is geared for massive (long-diameter) graphs. The total space needed for the computation is linear in the problem size, and the parallel depth is substantially sublinear in the diameter for graphs with low doubling dimension. To the best of our knowledge, ours are the first parallel approximations for these problems which achieve sub-diameter parallel time, for a relevant class of graphs, using only linear space. Besides the theoretical guarantees, our algorithms allow for a very simple implementation on clustered architectures: we report on extensive experiments which demonstrate their effectiveness and efficiency on large graphs as compared to alternative known approaches.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

3.8
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available