A Strongly Polynomial Time Algorithm for the Shortest Path Problem on Coherent Planar Periodic Graphs.
Norie FuPublished in: ISAAC (2012)
Keyphrases
- shortest path problem
- worst case
- dynamic programming
- computational complexity
- search space
- cost function
- polynomial time complexity
- np hard
- directed graph
- graph isomorphism
- optimization algorithm
- single source
- search strategy
- detection algorithm
- k means
- ant colony optimization
- matching algorithm
- probabilistic model
- benchmark problems
- planar graphs
- combinatorial optimization problems
- learning algorithm
- strongly polynomial
- graph mining
- upper bound
- lower bound
- optimal solution