Approximate Shortest Path on Polyhedral Surface Based on Selective Refinement of the Discrete Graph and Its Applications.
Takashi KanaiHiromasa SuzukiPublished in: GMP (2000)
Keyphrases
- shortest path
- shortest path problem
- weighted graph
- flow graph
- minimal surface
- finding the shortest path
- path length
- edge weights
- strongly connected components
- tree width
- graph search
- geodesic distance
- minimum spanning tree
- betweenness centrality
- shortest path algorithm
- steiner tree
- road network
- routing algorithm
- optimal path
- travel time
- random walk
- spanning tree
- path selection
- graph structure
- shortest distance
- social networks
- bipartite graph
- convex hull
- source node
- d objects
- dynamic programming