Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space.
Andreas JakobyTill TantauPublished in: Complexity of Boolean Functions (2006)
Keyphrases
- series parallel
- shortest path
- finding the shortest path
- minimal surface
- shortest path algorithm
- temporal reasoning
- weighted graph
- geodesic distance
- road network
- travel time
- constraint networks
- path length
- redundancy allocation
- strongly connected components
- flow graph
- tree decomposition
- worst case
- precedence constraints
- search algorithm
- betweenness centrality
- tabu search
- low dimensional