Finding next-to-shortest paths in a graph
From MaRDI portal
Publication:834912
DOI10.1016/j.ipl.2004.06.020zbMath1173.68609OpenAlexW1985676638MaRDI QIDQ834912
Ilia Krasikov, Steven D. Noble
Publication date: 27 August 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://bura.brunel.ac.uk/handle/2438/1677
Related Items (9)
Improved algorithm for finding next-to-shortest paths ⋮ Simple paths with exact and forbidden lengths ⋮ Approximating the Canadian traveller problem with online randomization ⋮ On the second point-to-point undirected shortest simple path problem ⋮ A simpler and more efficient algorithm for the next-to-shortest path problem ⋮ A quadratic algorithm for finding next-to-shortest paths in graphs ⋮ On the small cycle transversal of planar graphs ⋮ On the Small Cycle Transversal of Planar Graphs ⋮ An efficient algorithm to find next-to-shortest path on permutation graphs
Cites Work
This page was built for publication: Finding next-to-shortest paths in a graph
