Introduction to algorithms
On finding and updating shortest paths distributively
Journal of Algorithms
Reverse search for enumeration
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Efficient parallel shortest-paths in digraphs with a separator decomposition
Journal of Algorithms
A Parallelization of Dijkstra's Shortest Path Algorithm
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Shortest Path Queries in Digraphs of Small Treewidth
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Parallel Shortest Path for Arbitrary Graphs
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
Distributed verification: exploring the power of raw computing power
FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
Cluster-Based LTL model checking of large systems
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
| Hi-index | 0.00 |
A distributed algorithm for the single source shortest path problem for directed graphs with arbitrary edge lengths is proposed. The new algorithm is basedon 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.