Optimal Parallel Algorithms for Computing Single-Linkage Dendrograms

The authors present two novel deterministic parallel algorithms for efficiently computing the single-linkage dendrogram (SLD) of an input edge-weighted tree. Their algorithms achieve optimal work bounds and significantly outperform the commonly used sequential Union-Find algorithm.