A simpler and more efficient algorithm for the next-to-shortest path problem
From MaRDI portal
Publication:1939658
DOI10.1007/s00453-011-9601-7zbMath1259.05174arXiv1105.0608OpenAlexW3098776817MaRDI QIDQ1939658
Publication date: 5 March 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1105.0608
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Computing strictly-second shortest paths
- 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
- Undirected single-source shortest paths with positive integer weights in linear time
- Dominators in Linear Time
- Faster shortest-path algorithms for planar graphs
This page was built for publication: A simpler and more efficient algorithm for the next-to-shortest path problem