Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs.

Lin Tian Tadao Takaoka

Published in: ACSC (2007)

Keyphrases

shortest path
directed graph
shortest path problem
shortest path algorithm
strongly connected
minimum cost flow
road network
random walk
minimum spanning tree
np hard
optimal path
graph structures
maximum flow
edge weights
path selection
directed acyclic graph
computational complexity
reverse nearest neighbor