A shortest-path algorithm for Manhattan graphs

DOI10.1016/0020-0190(94)90049-3zbMath0787.68079OpenAlexW2021537754MaRDI QIDQ1313705

Kanchana Kanchanasut

Publication date: 24 February 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90049-3

zbMATH Keywords

shortest pathManhattan graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• A note on two problems in connexion with graphs
• Shortest paths in Euclidean graphs
• Some Variations of Lee's Algorithm
• A shortest path algorithm for grid graphs

This page was built for publication: A shortest-path algorithm for Manhattan graphs