Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree.
Paola FlocchiniAntonio Mesa EnriquesLinda PagliGiuseppe PrencipeNicola SantoroPublished in: IFIP TCS (2004)
Keyphrases
- shortest path
- steiner tree
- optimal path
- weighted graph
- shortest path problem
- road network
- spanning tree
- minimum spanning tree
- shortest path algorithm
- routing algorithm
- edge weights
- strongly connected components
- optimal solution
- dijkstra algorithm
- shortest distance
- travel time
- minimum length
- flow graph
- optimal location
- path planning
- dynamic programming
- path length
- tree structure