Computing the Shortest Path Tree in a Weak Visibility Polygon.
Subir Kumar GhoshAnil MaheshwariSudebkumar Prasant PalSanjeev SalujaC. E. Veni MadhavanPublished in: FSTTCS (1991)
Keyphrases
- shortest path
- shortest path problem
- minimum spanning tree
- steiner tree
- shortest path algorithm
- minimum length
- routing algorithm
- tree structure
- road network
- weighted graph
- path length
- path selection
- dijkstra algorithm
- optimal path
- flow graph
- minimal surface
- travel time
- minimum cost flow
- shortest distance
- art gallery
- edge weights
- geodesic distance
- multicast tree