Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of
Dynamic Agglomerative Graph Clustering

v1v2v3 (latest)

Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering

10 May 2022

Laxman Dhulipala

ArXiv (abs)PDF HTML

Papers citing "Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering"

6 / 6 papers shown

Title
Parallel Dynamic Maximal Matching M. Ghaffari Anton Trygub 21 1 0 23 Sep 2024
Concurrent Data Structures Made Easy (Extended Version) Callista Le K. Gopinathan Koon Wen Lee Seth Gilbert Ilya Sergey 128 1 0 25 Aug 2024
It's Hard to HAC with Average Linkage! M. Bateni Laxman Dhulipala Kishen N. Gowda D Ellis Hershkowitz Rajesh Jayaram Jakub Lkacki 58 2 0 23 Apr 2024
Parallel $k$ -Core Decomposition with Batched Updates and Asynchronous Reads Quanquan C. Liu Julian Shun Igor Zablotchi 26 4 0 15 Jan 2024
Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span Daniel Anderson G. Blelloch 17 1 0 14 Jun 2023
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth Laxman Dhulipala David Eisenstat Jakub Lacki Vahab Mirronki Jessica Shi 64 17 0 23 Jun 2022