Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice
Summary: First constant-round AMPC algorithms for connectivity, MSF, and approximate weighted matching with O(n^ε) memory per machine, improving MPC and prior AMPC bounds. Large-scale experiments show practical speed and round-count gains over optimized MPC baselines. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Soheil Behnezhad (University of Maryland)
- 2. Laxman Dhulipala (Massachusetts Institute of Technology)
- 3. Hossein Esfandiari (Google)
- 4. Jakub Łącki (Google)
- 5. Vahab Mirrokni (Google)
- 6. Warren Schudy (Google)
BibTeX Citation
@article{behnezhad_vldb20,
title = {{Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice}},
author = {Behnezhad, Soheil and Dhulipala, Laxman and Esfandiari, Hossein and Łącki, Jakub and Mirrokni, Vahab and Schudy, Warren},
journal = {PVLDB},
series = {{VLDB} '20},
volume = {13},
number = {13},
pages = {3588--3602},
doi = {10.14778/3424573.3424579},
url = {https://doi.org/10.14778/3424573.3424579},
year = {2020}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,862 | ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms | 2021 | VLDB | 5.5302333e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012250108 |
| 264 | The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing | 2018 | VLDB | 0.00022980015 |
| 556 | Fast Incremental and Personalized PageRank | 2011 | VLDB | 0.00016564032 |
| 793 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB | 0.00013978774 |
| 1,416 | Local Algorithms for Hierarchical Dense Subgraph Discovery | 2019 | VLDB | 0.00010839488 |
| 2,243 | Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs | 2019 | SIGMOD | 8.8813183e-05 |
| 4,244 | Algorithmic Aspects of Parallel Query Processing | 2018 | SIGMOD | 6.8062787e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,892 | Massively Parallel Algorithms for Personalized PageRank | 2021 | VLDB |
| 2 | 5,878 | Distributed Graph Simulation: Impossibility and Possibility | 2014 | VLDB |
| 3 | 11,634 | Algorithms for a Topology-aware Massively Parallel Computation Model | 2021 | PODS |
| 4 | 11,892 | Dynamic Scaling for Parallel Graph Computations | 2019 | VLDB |
| 5 | 1,246 | Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows | 2018 | VLDB |
| 6 | 4,697 | Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent | 2019 | VLDB |
| 7 | 3,616 | Parallel Local Graph Clustering | 2016 | VLDB |
| 8 | 1,875 | Large-Scale Distributed Graph Computing Systems: An Experimental Evaluation | 2015 | VLDB |
| 9 | 3,008 | Scalable Big Graph Processing in MapReduce | 2014 | SIGMOD |
| 10 | 6,599 | Adaptive Asynchronous Parallelization of Graph Algorithms | 2018 | SIGMOD |