A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths
Year: 2012
Type: preprint
Abstract: For two vertices $s$ and $t$ in a graph $G=(V,E)$, the next-to-shortest path is an $st$-path which length is minimum amongst all $st$-paths strictly longer than the shortest path length. In this paper we show that, when the graph is undirected and all edge lengths are nonnegative, the problem can be solved in linear time if the distances from $s$ and $t$ to all other vertices are given. This result generalizes the previous work (DOI 10.1007/s00453-011-9601-7) to allowing zero-length edges.
Source: arXiv (Cornell University)
Authors: Wu, Bang Ye, Guo, Jun-Lin, Wang, Yue-Li
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W101813742