most citedPECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search

1 citations · 1 across the 6 of their papers we have counts for

collaborators
Showing cs.DCShow all

2 papers · 1 filter

cs.DC2024

The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering

Shangdi Yu, Jessica Shi, Jamison Meindl +7

We introduce the ParClusterers Benchmark Suite (PCBS) -- a collection of highly scalable parallel graph clustering algorithms and benchmarking tools that streamline comparing diffe…

cs.DC2024

Parallel -Core Decomposition with Batched Updates and Asynchronous Reads

Quanquan C. Liu, Julian Shun, Igor Zablotchi

Maintaining a dynamic -core decomposition is an important problem that identifies dense subgraphs in dynamically changing graphs. Recent work by Liu et al. [SPAA 2022] presents…