Evaluation on Quantum Computation and Classic Parallel Approaches for Finding Estimation of the Length of Shortest Path in a Weighted Graph.
Mir Shahriar EmamiMohammad Reza FattahiHossein KeshmiriPublished in: ACIS-ICIS (2008)
Keyphrases
- shortest path
- weighted graph
- path length
- quantum computation
- road network
- routing algorithm
- shortest path problem
- minimum length
- edge weights
- graph model
- geodesic distance
- shortest path algorithm
- graph structure
- spanning tree
- graph partitioning
- flow graph
- minimum cut
- optimal path
- finding the shortest path
- data structure
- multi dimensional