TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
Summary: TeraHAC achieves (1+ε)-approximate HAC for trillion-edge graphs by fusing nearest-neighbor chain with (1+ε)-HAC, enabling partitioned, communication-efficient clustering. Scales to 8T edges; >100x fewer rounds than prior HAC, up to 8.3x faster than SCC, and preserves HAC quality. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Laxman Dhulipala
- 2. Jakub Łącki
- 3. Jason Lee
- 4. Vahab Mirrokni
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,879 | The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering | 2025 | VLDB | 4.1945683e-05 |
| 11,026 | Improving Graph Compression for Efficient Resource-Constrained Graph Analytics | 2024 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0019005923 |
| 4,497 | Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent | 2019 | VLDB | 6.1387773e-05 |
| 11,383 | ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain | 2022 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next