iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/3-540-45627-9_16
How to Employ Reverse Search in Distributed Single Source Shortest Paths | SpringerLink
Skip to main content
Springer Nature Link
Log in

How to Employ Reverse Search in Distributed Single Source Shortest Paths

  • Conference paper
  • First Online:
SOFSEM 2001: Theory and Practice of Informatics (SOFSEM 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2234))

Abstract

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 anduses 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.

This work has been partially supportedb y the Grant Agency of Czech Republic grant No. 201/00/1023.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. D. Avis and K. Fukuda. Reverse search for enumeration. Discrete Appl. Math., 65:21–46, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  2. S. Chaudhuri and C. D. Zaroliagis. Shortest path queries in digraphs of smalltreewidth. In Automata, Languages and Programming, pages 244–255, 1995.

    Google Scholar 

  3. B. V. Cherkassky and A. V. Goldberg. Negative-cycle detection algorithms. MathematicalProgramming, Springer-Verlag, 85:277–311, 1999.

    MATH  MathSciNet  Google Scholar 

  4. E. Cohen. Efficient parallel shortest-paths in digraphs with a separator decomposition.Journal of Algorithms, 21(2):331–357, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  5. T. H. Cormen, Ch. E. Leiserson, and R. L. Rivest. Introduction to Algorithms.MIT, 1990.

    Google Scholar 

  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 ComputerScience, volume 1450, pages 722–731. Springer-Verlag, 1998.

    Google Scholar 

  7. U. Meyer and P. Sanders. Parallel shortest path for arbitrary graphs. In 6thInternational EURO-PAR Conference. LNCS, 2000.

    Google Scholar 

  8. J. Nievergelt. Exhaustive search, combinatorial optimization anden umeration:Exploring the potential of raw computing power. In SOFSEM 2000, number 1963in LNCS, pages 18–35. Springer, 2000.

    Google Scholar 

  9. K. Ramarao and S. Venkatesan. On finding and updating shortest paths distributively.Journal of Algorithms, 13:235–257, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  10. J. Tra. and C.D. Zaroliagis. A simple parallel algorithm for the single-sourceshortest path problem on planar digraphs. In Parallel algorithms for irregularlystructured problems, volume 1117 of LNCS, pages 183–194. Springer, 1996.

    Google Scholar 

  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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Faculty of Informatics Masaryk University Brno, Czech Republic

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

Authors
  1. Luboš Brim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ivana Černá
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pavel Krčál
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Radek Pelánek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, University of Wroclaw, Przesmyckiego 20, 51-151, Wroclaw, Poland

    Leszek Pacholski

  2. Fac. of Mathematics, Physics, and Informatics, Inst. of Informatics, Comenius Univ., Mlynská dolina, 84248, Bratislava, Slovakia

    Peter Ružička

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brim, L., Černá, I., Krčál, P., Pelánek, R. (2001). How to Employ Reverse Search in Distributed Single Source Shortest Paths. In: Pacholski, L., Ružička, P. (eds) SOFSEM 2001: Theory and Practice of Informatics. SOFSEM 2001. Lecture Notes in Computer Science, vol 2234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45627-9_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-45627-9_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42912-8

  • Online ISBN: 978-3-540-45627-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation