Computing strictly-second shortest paths

DOI10.1016/S0020-0190(97)00122-1zbMath1336.68137MaRDI QIDQ287170

Marios C. Papaefthymiou, Kumar N. Lalgudi

Publication date: 26 May 2016

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

zbMATH Keywords

shortest paths\(k\)-shortest paths

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Finding next-to-shortest paths in a graph ⋮ Improved algorithm for finding next-to-shortest paths ⋮ Simple paths with exact and forbidden lengths ⋮ Approximating the Canadian traveller problem with online randomization ⋮ A simpler and more efficient algorithm for the next-to-shortest path problem ⋮ A quadratic algorithm for finding next-to-shortest paths in graphs ⋮ An efficient algorithm to find next-to-shortest path on permutation graphs

Cites Work

• Unnamed Item
• The directed subgraph homeomorphism problem
• On the spanning trees of weighted graphs
• Finding the k Shortest Paths

This page was built for publication: Computing strictly-second shortest paths