Skip to main content
SpringerLink
Log in

An Associative Version of the Bellman-Ford Algorithm for Finding the Shortest Paths in Directed Graphs

  • Conference paper
  • First Online:
Parallel Computing Technologies (PaCT 2001)

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

Included in the following conference series:

Abstract

In this paper by means of a model of associative parallel systems with vertical data processing (the STAR-machine), we propose a natural straight forward implementation of the Bellman-Ford shortest path algorithm. We represent this algorithm as the corresponding STAR procedure, justify its correctness and evaluate time complexity.

This work was supported in part by the Russian Foundation for Basic Research under Grant N 99-01-00548

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

Access this chapter

Log in via an institution
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.

References

  1. R. Bellman. On a Routing Problem. In: Quarterly of Applied Mathematics, 16, No. 1 (1958) 87–90.

    MathSciNet  MATH  Google Scholar 

  2. N. Christofides. Graph Theory, An Algorithmic Approach. Academic Press, New York (1975).

    Google Scholar 

  3. E.W. Dijkstra. A Note on Two Problems in Connection with Graphs. In: Numerische Mathematik, 1 (1959) 269–271.

    Article  MATH  MathSciNet  Google Scholar 

  4. L.R. Ford. Network Flow Theory. Rand Corporation Report P-923 (1956).

    Google Scholar 

  5. C.C. Foster. Content Addressable Parallel Processors. Van Nostrand Reinhold Company, New York (1976).

    Google Scholar 

  6. A.S. Nepomniaschaya. Solution of Path Problems Using Associative Parallel Processors. In: Proc. of the Intern. Conf. on Parallel and Distributed Systems, IEEE Computer Society Press, ICPADS’97, Korea, Seoul (1997) 610–617.

    Chapter  Google Scholar 

  7. A.S. Nepomniaschaya, M.A. Dvoskina. A Simple Implementation of Dijkstra’s Shortest Path Algorithm on Associative Parallel Processors. In: Fundamenta Informaticae, IOS Press, 43 (2000) 227–243.

    MATH  Google Scholar 

  8. A.S. Nepomniaschaya. An Associative Version of the Edmonds-Karp-Ford Shortest Path Algorithm. In: Bull. of the Novosibirsk Computing Center. Series: Computer Science. NCC Publisher, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Siberian Division of Russian Academy of Sciences, Institute of Computational Mathematics and Mathematical Geophysics, pr. Lavrentieva, 6, Novosibirsk, 630090, Russia

    A. S. Nepomniaschaya

Authors
  1. A. S. Nepomniaschaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Supercomputer Software Department, ICMand MG SB RAS, pr. Lavrentiev 6, 630090, Novosibirsk, Russia

    Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nepomniaschaya, A.S. (2001). An Associative Version of the Bellman-Ford Algorithm for Finding the Shortest Paths in Directed Graphs. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2001. Lecture Notes in Computer Science, vol 2127. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44743-1_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-44743-1_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42522-9

  • Online ISBN: 978-3-540-44743-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation