Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation-Reference-Cited by-同舟云学术

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

Published:2015-06-13 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Ceccarello Matteo¹,Pietracaprina Andrea¹,Pucci Geppino¹,Upfal Eli²

Affiliation:

1. Department of Information Engineering, University of Padova, Padova, Italy

2. Brown University, Providence, RI, USA

Funder

MIUR of Italy

NSF

University of Padova

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/2755573.2755591

Reference29 articles.

1. Project PEGASUS. www.cs.cmu.edu/~pegasus. Project PEGASUS. www.cs.cmu.edu/~pegasus.

2. Forbidden-set distance labels for graphs of bounded doubling dimension

3. I/O-efficient Hierarchical Diameter Approximation

4. Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Breaking the linear-memory barrier in MPC: Fast MIS on trees with strongly sublinear memory;Theoretical Computer Science;2021-01

2. Distributed Graph Diameter Approximation;Algorithms;2020-09-01

3. ELite;Proceedings of the 3rd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA);2020-06-14

4. Solving k-center clustering (with outliers) in MapReduce and streaming, almost as accurately as sequentially;Proceedings of the VLDB Endowment;2019-03

5. Breaking the Linear-Memory Barrier in $$\mathsf {MPC}$$ : Fast $$\mathsf {MIS}$$ on Trees with Strongly Sublinear Memory;Structural Information and Communication Complexity;2019