A hierarchical Algorithm to Solve the Shortest Path Problem in Valued Graphs
Michel KoskasPublished in: CoRR (2003)
Keyphrases
- shortest path problem
- detection algorithm
- shortest path
- dynamic programming
- single source
- computational complexity
- cost function
- combinatorial optimization problems
- optimal solution
- np hard
- knapsack problem
- particle swarm optimization
- segmentation algorithm
- worst case
- probabilistic model
- clustering method
- search strategy
- benchmark problems
- graph structure
- search space
- random graphs
- clustering algorithm
- attributed graphs
- adjacency graph
- graph isomorphism