1 citations · 1 across the 6 of their papers we have counts for
4 papers · 1 filter
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…
Approximate Nearest Neighbor Search with Window Filters
Joshua Engels, Benjamin Landrum, Shangdi Yu +2
We define and investigate the problem of : approximate nearest neighbor search where each point in the dataset has a numeric label, and the go…
PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search
Shangdi Yu, Joshua Engels, Yihao Huang +1
This paper studies density-based clustering of point sets. These methods use dense regions of points to detect clusters of arbitrary shapes. In particular, we study variants of den…
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs
Pattara Sukprasert, Quanquan C. Liu, Laxman Dhulipala +1
The densest subgraph problem has received significant attention, both in theory and in practice, due to its applications in problems such as community detection, social network ana…