Conference
Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation
| Τίτλος: | Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation |
|---|---|
| Συγγραφείς: | CECCARELLO, MATTEO, PIETRACAPRINA, ANDREA ALBERTO, PUCCI, GEPPINO, E. Upfal |
| Συνεισφορές: | Ceccarello, Matteo, Pietracaprina, ANDREA ALBERTO, Pucci, Geppino, E., Upfal |
| Έτος έκδοσης: | 2015 |
| Συλλογή: | Padua Research Archive (IRIS - Università degli Studi di Padova) |
| Θεματικοί όροι: | Parallel Graph Algorithm, Graph Decomposition, k-Center Problem, Diameter Approximation, MapReduce |
| Περιγραφή: | 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 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. |
| Τύπος εγγράφου: | conference object |
| Περιγραφή αρχείου: | STAMPA |
| Γλώσσα: | English |
| Relation: | info:eu-repo/semantics/altIdentifier/isbn/978-1-4503-3588-1; info:eu-repo/semantics/altIdentifier/wos/WOS:000569710500028; ispartofbook:Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures; 27th ACM Symposium on Parallelism in Algorithms and Architectures; firstpage:182; lastpage:191; numberofpages:10; https://hdl.handle.net/11577/3156391; http://dl.acm.org/citation.cfm?doid=2755573.2755591 |
| DOI: | 10.1145/2755573.2755591 |
| Διαθεσιμότητα: | https://hdl.handle.net/11577/3156391 https://doi.org/10.1145/2755573.2755591 http://dl.acm.org/citation.cfm?doid=2755573.2755591 |
| Αριθμός Καταχώρησης: | edsbas.81478F30 |
| Βάση Δεδομένων: | BASE |
| DOI: | 10.1145/2755573.2755591 |
|---|