Efficient Algorithms for Solving Shortest Paths on Nearly Acyclic Directed Graphs.
Shane SaundersTadao TakaokaPublished in: CATS (2005)
Keyphrases
- directed graph
- shortest path
- efficient algorithms for solving
- least squares
- lower bound
- np hard
- shortest path problem
- strongly connected
- random walk
- canonical correlation analysis
- shortest path algorithm
- road network
- np complete
- directed acyclic graph
- weighted graph
- graph structure
- undirected graph
- minimum cost flow
- path length
- finding the shortest path
- maximum flow
- optimal path
- graph structures
- special case
- minimal surface
- strongly connected components
- geodesic distance
- travel time
- optical flow
- computer vision