Shortest Path Computations in Source-Deplanarized Graphs.
Greg N. FredericksonSusanne E. HambruschHung-Yi TuPublished in: Inf. Process. Lett. (1993)
Keyphrases
- shortest path
- finding the shortest path
- weighted graph
- strongly connected components
- shortest path problem
- source node
- minimum spanning tree
- road network
- graph search
- edge weights
- shortest path algorithm
- betweenness centrality
- optimal path
- path length
- shortest distance
- routing algorithm
- graph partitioning
- directed graph
- graph theory
- minimum cost flow
- flow graph
- path selection
- dijkstra algorithm
- spanning tree
- graph model
- travel time
- path queries
- minimal surface
- small world
- video sequences