Preprint
Jul 2026
Almost Navigable Graphs
It is proved that any dataset admits a $\gamma$-almost navigable graph with just $O\left(\frac{n}{1-\gamma}\right)$ edges, linear in the dataset size, and a randomized algorithm for constructing such a graph in near-linear time is presented.
Pratyush Avi, Christopher Musco
· 0 citations