Highly Influenced

# An efficient time and space K point-to-point shortest simple paths algorithm

@article{SedeoNoda2012AnET, title={An efficient time and space K point-to-point shortest simple paths algorithm}, author={Antonio Sede{\~n}o-Noda}, journal={Applied Mathematics and Computation}, year={2012}, volume={218}, pages={10244-10257} }

- Published 2012 in Applied Mathematics and Computation
DOI:10.1016/j.amc.2012.04.002

We address the problem for finding the K best point-to-point simple paths connecting a given pair of nodes in a directed network with arbitrary lengths. The main result in this paper is the proof that a tree representing the kth point-to-point shortest simple path can be obtained by using one of the previous (k-1) trees representing each one of the previous (k-1) best point-to-point shortest simple paths. The proof requires that, in each iteration, at most n single-source shortest path… CONTINUE READING