Delineating imprecise regions via shortest-path graphs.
Mark de BergWouter MeulemansBettina SpeckmannPublished in: GIS (2011)
Keyphrases
- shortest path
- finding the shortest path
- weighted graph
- shortest path problem
- edge weights
- shortest path algorithm
- road network
- routing algorithm
- betweenness centrality
- minimum spanning tree
- graph search
- strongly connected components
- travel time
- path length
- flow graph
- optimal path
- graph partitioning
- path selection
- dijkstra algorithm
- minimal surface
- steiner tree
- graph theory
- directed graph