All pairs lightest shortest paths
From MaRDI portal
Publication:2819534
DOI10.1145/301250.301271zbMath1345.05106DBLPconf/stoc/Zwick99OpenAlexW1987719024WikidataQ60299176 ScholiaQ60299176MaRDI QIDQ2819534
Publication date: 29 September 2016
Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/301250.301271
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22)
Related Items (2)
An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs ⋮ All-pairs bottleneck paths in vertex weighted graphs
This page was built for publication: All pairs lightest shortest paths
