5 papers
Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
Quinten De Man, Gilvir Gill, Michael A. Bender +2
Dynamic connectivity is a fundamental dynamic graph problem, and recent algorithmic breakthroughs on dynamic graph sketching have reshaped what is theoretically possible: by encodi…
UFO Trees: Practical and Provably-Efficient Parallel Batch-Dynamic Trees
Quinten De Man, Atharva Sharma, Kishen N Gowda +1
The dynamic trees problem is to maintain a tree under edge updates while supporting queries like connectivity queries or path queries. Despite the first data structure for this fun…
Fast and Compact Sketch-Based Dynamic Connectivity
Quinten De Man, Qamber Jafri, Daniel Delayo +3
We study the dynamic connectivity problem for massive, dense graphs. Our goal is to build a system for dense graphs that simultaneously answers connectivity queries quickly, mainta…
Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
Quinten De Man, Laxman Dhulipala, Kishen N Gowda
Single-linkage clustering is a popular form of hierarchical agglomerative clustering (HAC) where the distance between two clusters is defined as the minimum distance between any pa…
Towards Scalable and Practical Batch-Dynamic Connectivity
Quinten De Man, Laxman Dhulipala, Adam Karczmarz +3
We study the problem of dynamically maintaining the connected components of an undirected graph subject to edge insertions and deletions. We give the first parallel algorithm for t…