How to Employ Reverse Search in Distributed Single-Source Shortest Paths

• Title in English: Distributed LTL Model-Checking Based on Negative Cycle Detection
• Authors: BRIM Luboš; ČERNÁ Ivana; KRČÁL Pavel; PELÁNEK Radek
• Year of publication: 2001
• Type: Article in Proceedings
• Conference: SOFSEM 2001
• MU Faculty or unit: Faculty of Informatics
• Field: Computer hardware and software
• Description: 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.

Related projects

• Algorithms and tools for practical verification of concurrent systems.
• Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing