Database Paper Browser

Back to papers

Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice

Summary: First constant-round AMPC algorithms for graph connectivity, MSF, and approximate max matching with O(n^ε) per-machine space (0<ε<1). Empirical study on large real-world graphs shows AMPC outperforms MPC baselines in time and rounds. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
12239
Venue
VLDB
Year
2020
Pagerank
4.1945683e-05
Overall Rank
11,630 | 19.10%
DOI
10.14778/3424573.3424579

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
7,871 ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms 2021 VLDB 4.6308128e-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.

Previous Page 1 / 1 Next

Semantically Similar Papers