An Algorithm for K Vertices-Constrained Shortest Paths
Sun Gangming, Pin Wang · 2013
An algorithm to find the first k shortest pahtes whose number of vertices are less or equal to m. In an undirected graph with n vertices and w edges, if loops are allowed in the pahtes, the algorithm's running time is O(2(w+n log2n)+nw+kwlog2k). If loops are not allowed, the algorithm's running time is is O(km((w+nlog2n)+mw)+kwlog2k).