Cycle avoidance in 2D/3D bidirectional graphs using shortest-path dynamic programming network.
Kai-Pui LamTerrence S. T. MakChi-Sang PoonPublished in: VLSI-SoC (2011)
Keyphrases
- finding the shortest path
- shortest path
- dynamic programming
- shortest path algorithm
- path length
- weighted graph
- dijkstra algorithm
- shortest path problem
- edge weights
- road network
- optimal path
- spatial networks
- path selection
- graph search
- lagrangian relaxation
- routing algorithm
- travel time
- shortest distance
- stereo matching
- transportation networks
- small world
- betweenness centrality
- image registration
- path planning
- peer to peer
- source node
- strongly connected components
- state space