Saurabh Paul, Christos Boutsidis, et al.
JMLR
Paper
New kth-shortest path algorithm
Abstract
This paper presents a new algorithm for finding the kth- shortest paths between a specified pair of vertices in a directed graph with arcs having non-negative costs.
Related
Matthew Arnold, David Piorkowski, et al.
IBM J. Res. Dev
Tushar Deepak Chandra, Sam Toueg
Journal of the ACM
Conference paper
A platform for massive agent-based simulation and its evaluation
Gaku Yamamoto, Hideki Tai, et al.
AAMAS 2008