Efficiently constructing sparse navigable graphs

DOI10.1137/1.9781611978971.59MaRDI QIDQ7294569zbMATH OpenFDO

Authors Alex Conway, Laxman Dhulipala, Martin Farach-Colton, Rob Johnson, Ben Landrum, Christopher Musco, Yarin Shechter, Torsten Suel, Richard Wen

Publication date 13 July 2026

Full work available at URL https://doi.org/10.1137/1.9781611978971.59

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Efficiently constructing sparse navigable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294569)