Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2205.04956
Cited By
v1
v2
v3 (latest)
Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering
10 May 2022
Tom Tseng
Laxman Dhulipala
Julian Shun
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering"
5 / 5 papers shown
Title
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time
Laxman Dhulipala
David Eisenstat
Jakub Lacki
Vahab Mirrokni
Jessica Shi
51
23
0
10 Jun 2021
Work-efficient Batch-incremental Minimum Spanning Trees with Applications to the Sliding Window Model
Daniel Anderson
G. Blelloch
Kanat Tangwongsan
34
16
0
13 Feb 2020
Online Hierarchical Clustering Approximations
A. Menon
Anand Rajagopalan
Baris Sumengen
Gui Citovsky
Qin Cao
Sanjiv Kumar
31
13
0
20 Sep 2019
PAM: Parallel Augmented Maps
Yihan Sun
Daniel Ferizovic
G. Blelloch
43
62
0
16 Dec 2016
A cost function for similarity-based hierarchical clustering
S. Dasgupta
70
195
0
16 Oct 2015
1