Paula Harder, Venkatesh Ramesh, et al.
EGU 2023
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
Ora Nova Fandina, Eitan Farchi, et al.
AAAI 2026
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Michael Factor, Dafna Sheinwald
Information Sciences