14 citations · 25 across the 8 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DS2024★ 1 cited
Tera-Scale Multilevel Graph Partitioning
Daniel Salwasser, Daniel Seemaier, Lars Gottesbüren +1
We present TeraPart, a memory-efficient multilevel graph partitioning method that is designed to scale to extremely large graphs. In balanced graph partitioning, the goal is to div…
cs.DS2024★ 2 cited
Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
Lars Gottesbüren, Laxman Dhulipala, Rajesh Jayaram +1
We consider the fundamental problem of decomposing a large-scale approximate nearest neighbor search (ANNS) problem into smaller sub-problems. The goal is to partition the input po…