method · first seen 27 Oct 2026
graph compression
Reducing memory of graph structures such as adjacency lists while keeping them efficiently accessible.
Mentions per week
PapersCodeDiscussion
Earliest sources
- Lossless Compression of Proximity Graph Indexes for Efficient Approximate Nearest Neighbors SearchPapers · 27 Oct 2026 · Francesco Benocci, Leonard Dahlmann, Francesco Gargiulo, Tobias Heuer, Silvio Ma…
Latest sources
- Lossless Compression of Proximity Graph Indexes for Efficient Approximate Nearest Neighbors SearchPapers · 27 Oct 2026 · Francesco Benocci, Leonard Dahlmann, Francesco Gargiulo, Tobias Heuer, Silvio Ma…