A set of sequential, parallel, and batch-parallel algorithms that explicitly maintain the single-linkage dendrogram of a dynamic forest, with update costs O(h), O(h log(1+n/h)), or O(c log(1+n/c)).
Acar, Daniel Anderson, Guy E
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
-
Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
A set of sequential, parallel, and batch-parallel algorithms that explicitly maintain the single-linkage dendrogram of a dynamic forest, with update costs O(h), O(h log(1+n/h)), or O(c log(1+n/c)).