On the Structure of Unique Shortest Paths in Graphs

DOI10.1137/1.9781611975482.125zbMath1434.05079arXiv1804.09745OpenAlexW2798331455MaRDI QIDQ5236311

Greg Bodwin

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

zbMATH Keywords

real-weighted graphsstrongly metrizable path system

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Signed and weighted graphs (05C22)

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