A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs.

Kuo-Hua Kao Jou-Ming Chang Yue-Li Wang Justie Su-tzu Juan

Published in: Algorithmica (2011)

Keyphrases

finding the shortest path
shortest path
dynamic programming
objective function
optimal path
simulated annealing
weighted graph
shortest path problem
strongly connected components
optimal solution
similarity search
distance function
graph theory
graph partitioning