A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity.

Published in: J. Comput. Syst. Sci. (2005)

Keyphrases

shortest path problem
shortest path
np hard
single source
search space
computational complexity
dynamic programming
objective function
cost function
interval data
optimal solution
search algorithm
simulated annealing
memory requirements
combinatorial optimization problems
memory efficient