On algorithms for finding the k shortest paths in a network
From MaRDI portal
Publication:3049826
DOI10.1002/net.3230090303zbMath0414.68034MaRDI QIDQ3049826
Publication date: 1979
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230090303
68R10: Graph theory (including graph drawing) in computer science
94C15: Applications of graph theory to circuits and networks
Related Items
New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems, An algorithm for finding the \(k\) quickest paths in a network, Unified approach to fuzzy graph problems, Diversification strategies in local search for a nonbifurcated network loading problem, On finding dissimilar paths, Multiple Routing Strategies in a Labelled Network, Finding the k Shortest Paths