Computing the nxm shortest path efficiently

DOI10.1145/351827.384251zbMath1071.68564OpenAlexW2026824953MaRDI QIDQ5463404

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

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

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