A Shortest Path Algorithm for Edge-Sparse Graphs

DOI10.1145/321921.321927MaRDI QIDQ4091991zbMATH OpenOpenAlexFDO

Authors Robert A. Wagner

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35)

Cited in

(12)

• Shortest-path algorithms: Taxonomy and annotation
• Scaling algorithms for network problems
• The lower bounds on distributed shortest paths
• The shortest path problem on large-scale real-road networks
• Some optimal path problems subject to improvements
• An O(m log D) algorithm for shortest paths
• Hybrid Bellman-Ford-Dijkstra algorithm
• Exploring monotone priority queues for Dijkstra optimization
• Automatic error correction in flexion languages
• An analogue of Hoffman's circulation conditions for max-balanced flows
• Regular algebra applied to language problems
• scientific article; zbMATH DE number 3795354 (Why is no real title available?)

This page was built for publication: A Shortest Path Algorithm for Edge-Sparse Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4091991)