Publication details
How to Employ Reverse Search in Distributed Single
-Source Shortest Paths
| Basic information | |
|---|---|
| Original title: | How to Employ Reverse Search in Distributed Single-Source Shortest Paths |
| Authors: | Luboš Brim, Ivana Černá, Pavel Krčál, Radek Pelánek |
| Further information | |
|---|---|
| Citation: | BRIM, Luboš - ČERNÁ, Ivana - KRČÁL, Pavel - PELÁNEK, Radek. How to Employ Reverse Search in Distributed Single-Source Shortest Paths. Brno : FI MU, 2001. 22 pp. Technical Reports, FIMU-RS-2001-09. |
| Original language: | English |
| Field: | Computer hardware and software |
| WWW: |  http://www.fi.muni.cz/informatics/reports/pdf/FIMU-RS-2001-09.pdf |
| Type: | Monograph |
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
