Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering

2 April 2021

Papers citing "Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering"

10 / 10 papers shown

Title
Sparsification and Reconstruction from the Perspective of Representation Geometry Wenjie Sun Bingzhe Wu Zhile Yang Chengke Wu 64 0 0 28 May 2025
Faster Parallel Triangular Maximally Filtered Graphs and Hierarchical Clustering Steven Raphael Julian Shun 65 1 0 18 Aug 2024
A Surprisingly Simple Method for Distributed Euclidean-Minimum Spanning Tree / Single Linkage Dendrogram Construction from High Dimensional Embeddings via Distance Decomposition Richard Lettich 59 0 0 03 Jun 2024
Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering Laxman Dhulipala Xiaojun Dong Kishen N. Gowda Yan Gu 81 3 0 29 Apr 2024
PANDORA: A Parallel Dendrogram Construction Algorithm for Single Linkage Clustering on GPU Piyush Sao Andrey Prokopenko Damien Lebrun-Grandié 51 2 0 11 Jan 2024
Parallel Filtered Graphs for Hierarchical Clustering Shangdi Yu Julian Shun 64 3 0 09 Mar 2023
NeuroPrim: An Attention-based Model for Solving NP-hard Spanning Tree Problems Yuchen Shi Congying Han Tiande Guo 62 3 0 22 Oct 2022
A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs Andrey Prokopenko Piyush Sao Damien Lebrun-Grandié 20 5 0 01 Jul 2022
Geometric reconstructions of density based clusterings A. Garcia-Pulido K. P. Samardzhiev 24 0 0 14 Mar 2022
ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain Shangdi Yu Yiqiu Wang Yan Gu Laxman Dhulipala Julian Shun 42 10 0 08 Jun 2021