A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs
From MaRDI portal
Publication:5363094
DOI10.1137/1.9781611973730.55zbMath1372.68209arXiv1506.08392OpenAlexW2951161514MaRDI QIDQ5363094
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.08392
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)
Related Items
Covering metric spaces by few trees ⋮ Space-efficient path-reporting approximate distance oracles ⋮ Covering Metric Spaces by Few Trees