On the Structure of Unique Shortest Paths in Graphs
From MaRDI portal
Publication:5236311
DOI10.1137/1.9781611975482.125zbMath1434.05079arXiv1804.09745OpenAlexW2798331455MaRDI QIDQ5236311
Publication date: 15 October 2019
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.09745
Related Items (7)
Drawing Shortest Paths in Geodetic Graphs ⋮ Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays ⋮ Geodesic geometry on graphs ⋮ Irreducible nonmetrizable path systems in graphs ⋮ Graph spanners: a tutorial review ⋮ New Results on Linear Size Distance Preservers ⋮ Drawing Shortest Paths in Geodetic Graphs
This page was built for publication: On the Structure of Unique Shortest Paths in Graphs