Academic Journal
Distributed graph diameter approximation
| Title: | Distributed graph diameter approximation |
|---|---|
| Authors: | Ceccarello M., Pietracaprina A., Pucci G., Upfal E. |
| Contributors: | Ceccarello, M., Pietracaprina, A., Pucci, G., Upfal, E. |
| Publisher Information: | MDPI AG |
| Publication Year: | 2020 |
| Collection: | Padua Research Archive (IRIS - Università degli Studi di Padova) |
| Subject Terms: | Graph analytic, MapReduce, Parallel graph algorithm, Weighted diameter approximation, Weighted graph decomposition |
| Description: | We present an algorithm for approximating the diameter of massive weighted undirected graphs on distributed platforms supporting a MapReduce-like abstraction. In order to be efficient in terms of both time and space, our algorithm is based on a decomposition strategy which partitions the graph into disjoint clusters of bounded radius. Theoretically, our algorithm uses linear space and yields a polylogarithmic approximation guarantee; most importantly, for a large family of graphs, it features a round complexity asymptotically smaller than the one exhibited by a natural approximation algorithm based on the state-of-the-art ∆-stepping SSSP algorithm, which is its only practical, linear-space competitor in the distributed setting. We complement our theoretical findings with a proof-of-concept experimental analysis on large benchmark graphs, which suggests that our algorithm may attain substantial improvements in terms of running time compared to the aforementioned competitor, while featuring, in practice, a similar approximation ratio. |
| Document Type: | article in journal/newspaper |
| File Description: | STAMPA |
| Language: | English |
| Relation: | info:eu-repo/semantics/altIdentifier/wos/WOS:000578996500001; volume:13; issue:9; firstpage:216; numberofpages:23; journal:ALGORITHMS; https://hdl.handle.net/11577/3367804 |
| DOI: | 10.3390/a13090216 |
| Availability: | https://hdl.handle.net/11577/3367804 https://doi.org/10.3390/a13090216 |
| Rights: | info:eu-repo/semantics/openAccess ; license:Creative commons ; license uri:http://creativecommons.org/licenses/by/4.0/ |
| Accession Number: | edsbas.9E6E93A9 |
| Database: | BASE |
Be the first to leave a comment!