Partitioning Graphs to Speed Up Dijkstra's Algorithm.
Rolf H. MöhringHeiko SchillingBirk SchützDorothea WagnerThomas WillhalmPublished in: WEA (2005)
Keyphrases
- times faster
- optimization algorithm
- learning algorithm
- dynamic programming
- worst case
- improved algorithm
- simulated annealing
- experimental evaluation
- cost function
- theoretical analysis
- k means
- high accuracy
- computationally efficient
- np hard
- optimal solution
- detection algorithm
- decision trees
- neural network
- computational cost
- multi objective
- matching algorithm
- objective function
- recognition algorithm
- graph structure
- spanning tree