Loading [MathJax]/jax/output/CommonHTML/jax.js
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Ranking One Million Simple Paths in Road Networks

    https://doi.org/10.1142/S0217595916500421Cited by:7 (Source: Crossref)

    In this paper, we address the problem of finding the K best paths connecting a given pair of nodes in a directed graph with arbitrary lengths. We introduce an algorithm to determine the K best paths in order of length when repeat nodes in the paths are allowed. We obtain an O(m+nlogn+K(n+logK)) time and O(K+m) space algorithm to implicitly determine the K shortest paths in a directed graph with n nodes and m arcs. Empirical results where the algorithm was used to compute one hundred million paths in USA road networks are reported. A non-trivial modification of the previous algorithm is performed obtaining an O(k1(nm+logk1)) time method to compute paths without repeat nodes and to answer the next question: how many paths k1 in practice are needed to identify K simple paths using the previous algorithm? We find that the response is usually O(K) based on an experiment computing one million paths in USA road networks. The determination of a theoretical tight bound on k1 remains as an open problem.