Optimally fast shortest path algorithms for some classes of graphs

DOI10.1080/00207169808804754zbMath0918.68080OpenAlexW1984673198MaRDI QIDQ4236113

Keiko Tsugane, Etsuro Moriya

Publication date: 17 August 1999

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169808804754

zbMATH Keywords

shortest path problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
• All-pairs-shortest-length on strongly chordal graphs
• Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
• Efficient Algorithms for Shortest Paths in Sparse Networks

This page was built for publication: Optimally fast shortest path algorithms for some classes of graphs