Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering*
Summary: Fast parallel EMST and HDBSCAN* via WSPD-based Kruskal and bichromatic closest pairs. A new well-separation reduces work; parallel divide-and-conquer builds dendrograms and reachability with compact WSP subsets, delivering speedups over serial and prior parallel methods. (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. Yiqiu Wang (Massachusetts Institute of Technology)
- 2. Shangdi Yu (Massachusetts Institute of Technology)
- 3. Yan Gu (University of California Riverside)
- 4. Julian Shun (Massachusetts Institute of Technology)
BibTeX Citation
@inproceedings{wang_sigmod21,
title = {{Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering*}},
author = {Wang, Yiqiu and Yu, Shangdi and Gu, Yan and Shun, Julian},
series = {{SIGMOD} '21},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3448016.3457296},
url = {https://dl.acm.org/doi/10.1145/3448016.3457296},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,115 | Parallel kd-tree with Batch Updates | 2025 | SIGMOD | 4.9793485e-05 |
| 11,889 | ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain | 2022 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 300 | OPTICS: Ordering Points To Identify the Clustering Structure | 1999 | SIGMOD | 0.00021810545 |
| 2,610 | NG-DBSCAN: Scalable Density-Based Clustering for Arbitrary Data | 2017 | VLDB | 8.2276558e-05 |
| 3,300 | RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning | 2018 | SIGMOD | 7.443826e-05 |
| 5,417 | Theoretically-Efficient and Practical Parallel DBSCAN | 2020 | SIGMOD | 6.138409e-05 |
| 5,990 | Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space | 2018 | SIGMOD | 5.9253259e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,887 | Fast Parallel Similarity Search in Multimedia Databases | 1997 | SIGMOD |
| 2 | 11,115 | Parallel kd-tree with Batch Updates | 2025 | SIGMOD |
| 3 | 8,240 | Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms | 2024 | SIGMOD |
| 4 | 11,702 | Fast Density-Based Clustering: Geometric Approach | 2023 | SIGMOD |
| 5 | 7,468 | Parallel Algorithms for High-dimensional Proximity Joins | 1997 | VLDB |
| 6 | 3,688 | Parallel Local Graph Clustering | 2016 | VLDB |
| 7 | 11,455 | Towards Scalable and Practical Batch-Dynamic Connectivity | 2025 | VLDB |
| 8 | 11,971 | Fast Density-Peaks Clustering: Multicore-based Parallelization Approach | 2021 | SIGMOD |
| 9 | 11,889 | ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain | 2022 | VLDB |
| 10 | 5,417 | Theoretically-Efficient and Practical Parallel DBSCAN | 2020 | SIGMOD |