Partitioning graphs to speedup Dijkstra's algorithm.
Rolf H. MöhringHeiko SchillingBirk SchützDorothea WagnerThomas WillhalmPublished in: ACM J. Exp. Algorithmics (2006)
Keyphrases
- detection algorithm
- learning algorithm
- dynamic programming
- theoretical analysis
- cost function
- search space
- preprocessing
- probabilistic model
- times faster
- clustering method
- computational complexity
- objective function
- computational cost
- high accuracy
- recognition algorithm
- particle swarm optimization
- hyper graph
- brute force
- improved algorithm
- polynomial time complexity
- optimization algorithm
- segmentation algorithm
- expectation maximization
- input data
- simulated annealing
- significant improvement
- k means
- evolutionary algorithm
- optimal solution