Tight Lower Bounds for Computing Shortest Paths on Proper Interval and Bipartite Permutation Graphs.
Lin ChenPublished in: PaCT (1997)
Keyphrases
- lower bound
- shortest path
- finding the shortest path
- weighted graph
- upper bound
- graph model
- graph partitioning
- shortest path algorithm
- edge weights
- bipartite graph
- branch and bound algorithm
- optimal solution
- shortest path problem
- worst case
- np hard
- betweenness centrality
- branch and bound
- travel time
- objective function
- graph search
- strongly connected components
- road network
- dynamic programming
- path length
- undirected graph
- flow graph
- geodesic distance
- spatial networks
- minimal surface
- minimum length
- spanning tree