Shortest Path Algorithms for Nearly Acyclic Directed Graphs.
Tadao TakaokaPublished in: Theor. Comput. Sci. (1998)
Keyphrases
- shortest path
- directed graph
- shortest path algorithm
- shortest path problem
- minimum cost flow
- edge weights
- weighted graph
- path length
- road network
- strongly connected components
- minimal surface
- maximum flow
- combinatorial optimization
- energy consumption
- random walk
- strongly connected
- np hard
- special case
- social networks