ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain
Summary: ParChain parallelizes HAC via NN-chain, enabling linear-memory complete/average/Ward linkages. Two optimizations: range-pruning and distance caching cut computations and memory, yielding speedups on hardware scalable to tens of millions of points. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Shangdi Yu
- 2. Yiqiu Wang
- 3. Yan Gu
- 4. Laxman Dhulipala
- 5. Julian Shun
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,681 | TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs | 2023 | SIGMOD | 4.3047774e-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,296 | Twister Tries: Approximate Hierarchical Agglomerative Clustering for Average Distance in Linear Time | 2015 | SIGMOD | 6.2885419e-05 |
| 7,871 | ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms | 2021 | VLDB | 4.6308128e-05 |
| 11,477 | Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering* | 2021 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next