Skip to main content
SpringerLink
Log in

Constructions Used in Associative Parallel Algorithms for Directed Graphs

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

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9251))

Included in the following conference series:

  • 955 Accesses

Abstract

The paper selects constructions that are used to implement a group of algorithms for directed graphs on a model of associative parallel systems with vertical processing (the STAR–machine). Moreover, a new implementation on the STAR–machine of Dijkstra’s algorithm for finding the single–source shortest paths is proposed.

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 EPUB and 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

References

  1. Dijkstra, E.W.: A note on two problems in connection with graphs. J. Numerische Mathematik. 1, 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  2. Italiano, G.F.: Amortized efficiency of a path retrieval data structure. J. Theoret. Comput. Sci. 48(2–3), 273–281 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  3. Italiano, G.F.: Finding paths and deleting edges in directed acyclic graphs. J. Inf. Process. Lett. 28, 5–11 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  4. Nepomniaschaya, A.S., Dvoskina, M.A.: A simple implementation of Dijkstra’s shortest path algorithm on associative parallel processors. J. Fundamenta Informaticae 43, 227–243 (2000). IOS Press

    MATH  Google Scholar 

  5. Nepomniaschaya, A.S.: Basic associative parallel algorithms for vertical processing systems. In: Bulletin of the Novosibirsk Computing Center, IIS Special Issue 29, pp. 63–77. NCC Publisher (2009)

    Google Scholar 

  6. Nepomniaschaya, A.S.: Constructions used in associative parallel algorithms for undirected graphs. Part 1. In: Bulletin of the Novosibirsk Computing Center, IIS Special Issue 35, pp. 67–81. NCC Publisher (2013)

    Google Scholar 

  7. Nepomniaschaya, A.S.: Constructions used in associative parallel algorithms for undirected graphs. Part 2. In: Bulletin of the Novosibirsk Computing Center, Issue 36, pp. 65–78. NCC Publisher (2014)

    Google Scholar 

  8. Nepomniaschaya, A. S.: Concurrent selection of the shortest paths and distances in directed graphs using vertical processing systems. In: Bulletin of the Novosibirsk Computing Center, Issue 19, pp. 61–72. NCC Publisher (2003)

    Google Scholar 

  9. Nepomniaschaya, A.S.: Associative version of italiano’s decremental algorithm for the transitive closure problem. In: Malyshkin, V.E. (ed.) PaCT 2007. LNCS, vol. 4671, pp. 442–452. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Nepomniaschaya, A.S.: Efficient Implementation of the Italiano algorithms for updating the transitive closure on associative parallel processors. J. Fundamenta Informaticae. 89(2–3), 313–329 (2008). IOS Press

    MathSciNet  MATH  Google Scholar 

  11. Nepomniaschaya, A.S.: Efficient parallel implementation of the Ramalingam decremental algorithm for updating the shortest paths subgraph. J. Comput. Inform. 32, 331–354 (2013)

    MathSciNet  Google Scholar 

  12. Nepomniaschaya, A.S.: Associative version of the Ramalingam algorithm for the dynamic update of the shortest paths subgraph after inserting a new edge. J. Cybern. Syst. Anal. 3, 45–57 (2012). Kiev: Naukova Dumka (in Russian) (English translation by Springer)

    MathSciNet  Google Scholar 

  13. Ramalingam, G.: Bounded Incremental Computation. LNCS, vol. 1089. Springer, Heidelberg (1996)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Anna Nepomniaschaya

Authors
  1. Anna Nepomniaschaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anna Nepomniaschaya .

Editor information

Editors and Affiliations

  1. Russian Academy of Sciences, Novosibirsk, Russia

    Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Nepomniaschaya, A. (2015). Constructions Used in Associative Parallel Algorithms for Directed Graphs. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2015. Lecture Notes in Computer Science(), vol 9251. Springer, Cham. https://doi.org/10.1007/978-3-319-21909-7_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21909-7_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21908-0

  • Online ISBN: 978-3-319-21909-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation