Optimally fast shortest path algorithms for some classes of graphs

DOI10.1080/00207169808804754MaRDI QIDQ4236113zbMATH OpenOpenAlexFDO

Authors Etsuro Moriya, Keiko Tsugane

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)

Recommendations

• Faster algorithms for the shortest path problem
• Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
• Approximating Shortest Paths in Graphs
• Shortest path algorithms for nearly acyclic directed graphs
• Faster shortest paths in dense distance graphs, with applications
• Faster algorithms for all-pairs approximate shortest paths in undirected graphs
• Faster shortest-path algorithms for planar graphs
• Faster shortest-path algorithms for planar graphs
• Solving shortest paths efficiently on nearly acyclic directed graphs
• Speed-Up Techniques for Shortest-Path Computations

Cites work

• A note on two problems in connexion with graphs
• All-pairs-shortest-length on strongly chordal graphs
• An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)

Cited in

(9)

• Search for \(C\)-optimal routes in graphs
• scientific article; zbMATH DE number 1576683 (Why is no real title available?)
• Speeding up Graph Algorithms via Switching Classes
• Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
• An efficient algorithm to determine all shortest paths in Sierpiński graphs
• scientific article; zbMATH DE number 1182573 (Why is no real title available?)
• The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph
• Solving shortest paths efficiently on nearly acyclic directed graphs
• On the fastest moving off from a vertex in directed regular graphs

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

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