A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths

Details A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths

2012-03-23

arxiv.org/abs/1203.5235v1

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-472250