Weiming Hu, Nianhua Xie, et al.
IEEE TPAMI
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
Conference paper
Toward Scientific Workflows in a Serverless World
Aakash Khochare, Yogesh Simmhan, et al.
eScience 2022
Sashi Novitasari, Takashi Fukuda, et al.
INTERSPEECH 2025
Ronald Fagin
Journal of the ACM