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
Joseph Y. Halpern, Yoram Moses
Journal of the ACM
Conference paper
Generating random solutions for constraint satisfaction problems
Rina Dechter, Kalev Kask, et al.
AAAI/IAAI 2002
Conference paper
Predicting knowledge in an ontology stream
Freddy Lécué, Jeff Z. Pan
IJCAI 2013