Solving the Shortest-Paths Problem on Bipartite Permutation Graphs Efficiently.
Lin ChenPublished in: Inf. Process. Lett. (1995)
Keyphrases
- shortest path
- finding the shortest path
- weighted graph
- graph model
- shortest path algorithm
- bipartite graph
- shortest path problem
- edge weights
- strongly connected components
- road network
- graph partitioning
- undirected graph
- graph search
- path length
- dynamic programming
- travel time
- flow graph
- combinatorial optimization
- graph theory
- connected components
- betweenness centrality
- moving objects
- geodesic distance
- information flow
- optimal path
- graph structure
- minimum cost flow