Centroid and Ward's hierarchical agglomerative clustering admit polylogarithmic-depth parallel algorithms in low dimensions via a new proof that their dendrograms are shallow.
Introduction to Parallel Algorithms (DRAFT) , 2024
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Parallel Hierarchical Agglomerative Clustering in Low Dimensions
Centroid and Ward's hierarchical agglomerative clustering admit polylogarithmic-depth parallel algorithms in low dimensions via a new proof that their dendrograms are shallow.