A Shortest Path Algorithm for Edge-Sparse Graphs
From MaRDI portal
Publication:4091991
DOI10.1145/321921.321927zbMath0327.05120OpenAlexW2023367804MaRDI QIDQ4091991
Publication date: 1976
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321921.321927
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10)
Related Items
Scaling algorithms for network problems, An O(m log D) algorithm for shortest paths, Unnamed Item, Hybrid Bellman-Ford-Dijkstra algorithm, Shortest-path algorithms: Taxonomy and annotation, Some optimal path problems subject to improvements, An analogue of Hoffman's circulation conditions for max-balanced flows, The shortest path problem on large-scale real-road networks, The lower bounds on distributed shortest paths, Automatic error correction in flexion languages, Regular algebra applied to language problems