Solving the all-pair shortest path query problem on interval and circular-arc graphs.
Danny Z. ChenD. T. LeeR. SridharChandra N. SekharanPublished in: Networks (1998)
Keyphrases
- shortest path
- path queries
- circular arcs
- flow graph
- finding the shortest path
- weighted graph
- road network
- shortest path problem
- shortest path algorithm
- query processing
- edge weights
- graph search
- optimal path
- strongly connected components
- geodesic distance
- path length
- shortest distance
- minimum spanning tree
- travel time
- straight line
- vector space
- line segments
- combinatorial optimization
- bipartite graph
- dynamic programming