Given an edge-weighted undirected graph G and two prescribed vertices u and v, a next-to-shortest (u, v)-path is a shortest (u, v)-path amongst all (u, v)-paths having length strictly greater than the length of a shortest (u, v)-path. In this paper, we deal with the problem of computing a next-to-shortest (u, v)-path. We propose an O(n 2 ) time algorithm for solving this problem, which significantly improves the bound of a previous one in O(n 3 ) time where n is the number of vertices in G.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.