A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM
Srinivasan Chandrasekar, Pradip K. Srimani · International Journal of Parallel Emergent and Distributed Systems · 1994
In this paper we propose a simple and elegant distributed self-stabilizing algorithm to solve the all-pairs shortest path problem in graph theory. We have proved the correctness of our algorithm without using a bounded function (which is customary for proving correctness of self-stabilizing algorithms); the new approach is simple and seems to have potential in developing self-stabilizing algorithms for other graph-theoretical problems.