28 citations · 28 across the 2 of their papers we have counts for
3 papers
cs.DS2022
Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering
Tom Tseng, Laxman Dhulipala, Julian Shun
Hierarchical agglomerative clustering (HAC) is a popular algorithm for clustering data, but despite its importance, no dynamic algorithms for HAC with good theoretical guarantees e…
cs.DB2020★ 28 cited
Parallel Index-Based Structural Graph Clustering and Its Approximation
Tom Tseng, Laxman Dhulipala, Julian Shun
SCAN (Structural Clustering Algorithm for Networks) is a well-studied, widely used graph clustering algorithm. For large graphs, however, sequential SCAN variants are prohibitively…
cs.DS2018
Batch-Parallel Euler Tour Trees
Thomas Tseng, Laxman Dhulipala, Guy Blelloch
The dynamic trees problem is to maintain a forest undergoing edge insertions and deletions while supporting queries for information such as connectivity. There are many existing da…