How to employ reverse search in distributed single source shortest paths

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2234, Issue , 2001, Pages 191-200

  Brim, Luboš ^a   Černá, Ivana ^a   Krčál, Pavel ^a   Pelánek, Radek ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ADDITIONAL DATUM; EDGE LENGTH; REVERSE SEARCH; SINGLE SOURCE SHORTEST PATH PROBLEMS; SINGLE SOURCE SHORTEST PATHS;

DIRECTED GRAPHS;

EID: 33749629580     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45627-9_16     Document Type: Conference Paper

References (11)

1. D. Avis and K. Fukuda. Reverse search for enumeration. Discrete Appl. Math., 65:21–46, 1996.
2. S. Chaudhuri and C. D. Zaroliagis. Shortest path queries in digraphs of small treewidth. In Automata, Languages and Programming, pages 244–255, 1995.
3. B. V. Cherkassky and A. V. Goldberg. Negative-cycle detection algorithms. Mathematical Programming, Springer-Verlag, 85:277–311, 1999.
4. E. Cohen. Efficient parallel shortest-paths in digraphs with a separator decomposition. Journal of Algorithms, 21(2):331–357, 1996.
5. T. H. Cormen, Ch. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT, 1990.
6. A. Crauser, K. Mehlhorn, U. Meyer, and P. Sanders. A parallelization of Dijkstra’s shortest path algorithm. In Proc. 23rd MFCS’98, Lecture Notes in Computer Science, volume 1450, pages 722–731. Springer-Verlag, 1998.
7. U. Meyer and P. Sanders. Parallel shortest path for arbitrary graphs. In 6th International EURO-PAR Conference. LNCS, 2000.
8. J. Nievergelt. Exhaustive search, combinatorial optimization anden umeration: Exploring the potential of raw computing power. In SOFSEM 2000, number 1963 in LNCS, pages 18–35. Springer, 2000.
9. K. Ramarao and S. Venkatesan. On finding and updating shortest paths distributively. Journal of Algorithms, 13:235–257, 1992.
10. J. Traff and C.D. Zaroliagis. A simple parallel algorithm for the single-source shortest path problem on planar digraphs. In Parallel algorithms for irregularly structured problems, volume 1117 of LNCS, pages 183–194. Springer, 1996.
11. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification (preliminary report). In 1st Symp. on Logic in Computer Science, LICS’86, pages 332–344. Computer Society Press, 1986.