Computing strictly-second shortest paths

DOI10.1016/S0020-0190(97)00122-1MaRDI QIDQ287170zbMATH OpenFDO

Authors Kumar N. Lalgudi, Marios C. Papaefthymiou

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

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

Recommendations

• On the second point-to-point undirected shortest simple path problem
• Finding \(k\) simple shortest paths and cycles
• Finding next-to-shortest paths in a graph
• On the difficulty of some shortest path problems
• scientific article; zbMATH DE number 1962826

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• Finding the k Shortest Paths
• On the spanning trees of weighted graphs
• The directed subgraph homeomorphism problem

Cited in

(8)

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

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

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