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)).
2023.Parallel Batch-Dynamic Algorithms Dynamic Trees, Graphs, and Self-Adjusting Computation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 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)).