The report FIMU-RS-2001-09
How to Employ Reverse Search in Distributed Single Source Shortest Paths
A distributed algorithm for the single-source shortest path problem for directed graphs with arbitrary edge lengths is proposed. The new algorithm is based on relaxations and uses reverse search for inspecting edges and thus avoids using any additional data structures. At the same time the algorithm uses a novel way to recognize a reachable negative-length cycle in the graph which facilitates the scalability of the algorithm.
Please install a newer browser for this site to function properly.