BRIM, Luboš, Ivana ČERNÁ, Pavel KRČÁL and Radek PELÁNEK. How to Employ Reverse Search in Distributed Single-Source Shortest Paths (Distributed LTL Model-Checking Based on Negative Cycle Detection). How to Employ Reverse Search in Distributed Single-Source Shortest Paths. In SOFSEM 2001. Piestany: Springer, 2001, p. 191-200. LNCS 2234. ISBN 3-540-42912-3. |
Other formats:
BibTeX
LaTeX
RIS
@inproceedings{371120, author = {Brim, Luboš and Černá, Ivana and Krčál, Pavel and Pelánek, Radek}, address = {Piestany}, booktitle = {SOFSEM 2001}, location = {Piestany}, isbn = {3-540-42912-3}, pages = {191-200}, publisher = {Springer}, title = {How to Employ Reverse Search in Distributed Single-Source Shortest Paths}, year = {2001} }
TY - JOUR ID - 371120 AU - Brim, Luboš - Černá, Ivana - Krčál, Pavel - Pelánek, Radek PY - 2001 TI - How to Employ Reverse Search in Distributed Single-Source Shortest Paths VL - LNCS 2234 PB - Springer CY - Piestany SN - 3540429123 N2 - 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. ER -
BRIM, Luboš, Ivana ČERNÁ, Pavel KRČÁL and Radek PELÁNEK. How to Employ Reverse Search in Distributed Single-Source Shortest Paths (Distributed LTL Model-Checking Based on Negative Cycle Detection). How to Employ Reverse Search in Distributed Single-Source Shortest Paths. In \textit{SOFSEM 2001}. Piestany: Springer, 2001, p.~191-200. LNCS 2234. ISBN~3-540-42912-3.
|