Login / Signup
Improved Shortest Path Algorithms for Nearly Acyclic Graphs.
Shane Saunders
Tadao Takaoka
Published in:
Electron. Notes Theor. Comput. Sci. (2001)
Keyphrases
</>
shortest path
shortest path algorithm
minimum cost flow
reverse nearest neighbor
data structure
edge weights
shortest path problem
minimum spanning tree
optimization problems
routing algorithm
weighted graph
travel time
optimal path
strongly connected components