An ADD-based algorithm for shortest path back-tracing of large graphs.
R. Iris BaharGary D. HachtelAbelardo PardoMassimo PoncinoFabio SomenziPublished in: Great Lakes Symposium on VLSI (1994)
Keyphrases
- shortest path
- shortest path problem
- finding the shortest path
- minimum spanning tree
- path length
- dijkstra algorithm
- weighted graph
- search space
- optimal path
- road network
- ant colony optimization
- simulated annealing
- dynamic programming
- shortest distance
- np hard
- strongly connected components
- optimal solution
- spanning tree
- graph search