Login / Signup
On the complexity of finding paths in a two-dimensional domain I: Shortest paths.
Arthur W. Chou
Ker-I Ko
Published in:
Math. Log. Q. (2004)
Keyphrases
</>
shortest path
shortest path problem
path length
optimal path
road network
weighted graph
shortest path algorithm
minimal surface
routing algorithm
distance transformation
flow graph
travel time
shortest distance
knn
multi dimensional
strongly connected components