Shortest Paths in Nearly Conservative Digraphs.

Zoltán Király

Published in: IPEC (2014)

Keyphrases

shortest path
road network
shortest path problem
shortest path algorithm
finding the shortest path
weighted graph
routing algorithm
directed graph
optimal path
geodesic distance
shortest distance
travel time
path length
flow graph
minimal surface
minimum cost flow
high dimensional