The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering
Summary: PCBS unifies scalable parallel algorithms and tooling for community detection, classification, and dense-subgraph mining, enabling fine-grained runtime/quality comparisons. Its methods are 4× faster than competing libraries; LambdaCC often achieves best quality. (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. Shangdi Yu (Massachusetts Institute of Technology)
- 2. Jessica Shi (Massachusetts Institute of Technology)
- 3. Jamison Meindl (Massachusetts Institute of Technology)
- 4. David Eisenstat (Google)
- 5. Xiaoen Ju (Google)
- 6. Sasan Tavakkol (Google)
- 7. Laxman Dhulipala (University of Maryland)
- 8. Jakub Łącki (Google)
- 9. Vahab Mirrokni (Google)
- 10. Julian Shun (Massachusetts Institute of Technology)
BibTeX Citation
@article{yu_vldb25,
title = {{The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering}},
author = {Yu, Shangdi and Shi, Jessica and Meindl, Jamison and Eisenstat, David and Ju, Xiaoen and Tavakkol, Sasan and Dhulipala, Laxman and Łącki, Jakub and Mirrokni, Vahab and Shun, Julian},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {3},
pages = {836--849},
doi = {10.14778/3712221.3712246},
url = {https://doi.org/10.14778/3712221.3712246},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,482 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB | 8.5183361e-05 |
| 4,358 | Parallel Index-Based Structural Graph Clustering and Its Approximation | 2021 | SIGMOD | 6.7459836e-05 |
| 6,961 | GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra | 2021 | VLDB | 5.7303405e-05 |
| 7,862 | ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms | 2021 | VLDB | 5.5302333e-05 |
| 9,816 | TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs | 2023 | SIGMOD | 5.214913e-05 |
| 13,454 | Scalable Community Detection via Parallel Correlation Clustering | 2021 | VLDB | - |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,563 | LDBC Graphalytics: A Benchmark for Large-Scale Graph Analysis on Parallel and Distributed Platforms | 2016 | VLDB |
| 2 | 11,286 | Fast and Space-Efficient Parallel Algorithms for Influence Maximization | 2024 | VLDB |
| 3 | 5,197 | Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach | 2021 | VLDB |
| 4 | 6,961 | GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra | 2021 | VLDB |
| 5 | 1,163 | Local Graph Sparsification for Scalable Clustering | 2011 | SIGMOD |
| 6 | 4,358 | Parallel Index-Based Structural Graph Clustering and Its Approximation | 2021 | SIGMOD |
| 7 | 10,794 | SBSC: A fast Self-tuned Bipartite proximity graph-based Spectral Clustering | 2025 | SIGMOD |
| 8 | 3,511 | Scalable Discovery of Best Clusters on Large Graphs | 2010 | VLDB |
| 9 | 3,616 | Parallel Local Graph Clustering | 2016 | VLDB |
| 10 | 13,454 | Scalable Community Detection via Parallel Correlation Clustering | 2021 | VLDB |