Computing the nxm shortest path efficiently

DOI10.1145/351827.384251MaRDI QIDQ5463404zbMATH OpenOpenAlexFDO

Authors Tetsuo Shibuya

Publication date 4 August 2005

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/351827.384251

zbMATH Keywords

GISall-pairs shortest paths\(A^\ast\) algorithm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Computing the shortest path: A^ search meets graph theory
• An Appraisal of Some Shortest-Path Algorithms
• The shortest path problem on large-scale real-road networks
• scientific article; zbMATH DE number 2150205
• Comparaison d'algorithmes de plus courts chemins sur des graphes routiers de grande taille

Cited in

(12)

• Routing algorithms with range restriction in sparse supply networks
• Computing Pathwidth Faster Than 2 n
• Shortest path problem with multiple shortest paths
• Computing the shortest path: A^ search meets graph theory
• Solving shortest paths efficiently on nearly acyclic directed graphs
• The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph
• BMA *: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps
• N-shortest paths retrieval algorithm based on artificial immunity
• scientific article; zbMATH DE number 2150205 (Why is no real title available?)
• scientific article; zbMATH DE number 5039783 (Why is no real title available?)
• scientific article; zbMATH DE number 124663 (Why is no real title available?)
• scientific article; zbMATH DE number 599010 (Why is no real title available?)

This page was built for publication: Computing the nxm shortest path efficiently

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