Efficiently Constructing Sparse Navigable Graphs
Abstract
Graph-based nearest neighbor search methods have seen a surge of popularity in recent years, offering state-of-the-art performance across a wide variety of applications. Central to these methods is the task of constructing a sparse navigable search graph for a given dataset endowed with a distance function. Unfortunately, doing so is computationally expensive, so heuristics are universally used in practice.
Fields of Study & Subjects
Graph Theory and Algorithms
Data Management and Algorithms
Advanced Image and Video Retrieval Techniques
Publication details
- Journal / source
- Society for Industrial and Applied Mathematics eBooks
- Pages
- 1631–1665
- Publication date
- 1 January 2026
- Language
- EN