Optimal Finding the All-Pair Shortest Path for Interval Graphs on a Reconfigurable Array of Processors with Wider Bus Networks.
Horng-Ren TsaiShi-Jinn HorngShung-Shing LeeTzong-Wann KaoPublished in: PDPTA (1996)
Keyphrases
- travel time
- shortest path
- transportation networks
- betweenness centrality
- finding the shortest path
- road network
- edge weights
- optimal path
- weighted graph
- path length
- shortest path problem
- path selection
- shortest path algorithm
- steiner tree
- routing algorithm
- source node
- strongly connected components
- minimum spanning tree
- social networks
- optimal solution
- graph search
- minimum length
- network design
- np hard
- dijkstra algorithm
- minimal surface
- network coding
- optimal location
- hardware implementation
- dynamic programming
- real world networks
- complex networks
- small world
- knapsack problem
- graph partitioning