Computing strictly-second shortest paths
From MaRDI portal
Publication:287170
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)
68Q25: Analysis of algorithms and problem complexity
05C38: Paths and cycles
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Simple paths with exact and forbidden lengths, A quadratic algorithm for finding next-to-shortest paths in graphs, Finding next-to-shortest paths in a graph, Improved algorithm for finding next-to-shortest paths, An efficient algorithm to find next-to-shortest path on permutation graphs, A simpler and more efficient algorithm for the next-to-shortest path problem, Approximating the Canadian traveller problem with online randomization
Cites Work