An efficient algorithm for K shortest simple paths
From MaRDI portal
Publication:3956415
DOI10.1002/net.3230120406zbMath0493.68068MaRDI QIDQ3956415
Toshihide Ibaraki, Naoki Katoh, Hisashi Mine
Publication date: 1982
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230120406
68Q25: Analysis of algorithms and problem complexity
05C35: Extremal problems in graph theory
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
Related Items
Element perturbation problems of optimum spanning trees with two-parameter objectives, An algorithm for finding the \(k\) quickest paths in a network, Finding the \(k\) quickest simple paths in a network, A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations, Multiobjective routing problems, On finding dissimilar paths, Finding the k Shortest Paths