Skip to main content
Home

Main menu

  • About
    • Journal
    • Editorial
    • ISSN
  • Series
    • Computer Science
    • Mathematical Modeling in Geophysics
    • Numerical Analysis
    • Numerical Modeling in Atmosphere, Ocean, and Environment Studies
  • Search
  • Authors
  • Submission
    • How to submit
    • Submit article
  • Contacts

Associative parallel algorithm for dynamic reconstruction of the shortest paths tree after insertion of a vertex

Search

Author(s)
Nepomniaschaya Anna,
Snytnikova Tatyana
Abstract

Finding shortest paths in a weighted graph is a fundamental and well studied problem in computer science. Such a problem arises in practice in different application settings.

File
nepomniaschaya_snytnikova.pdf260.9 KB
Issue
Computer Science, № 24, 2006
Pages
89-103
© 2015 - 2022 Ershov IIS SB RAS, ICM&MG SB RAS
Registration Сertificate ЭЛ № ФС 77 – 68696
    • About
      • Journal
      • Editorial
      • ISSN
    • Series
      • Computer Science
      • Mathematical Modeling in Geophysics
      • Numerical Analysis
      • Numerical Modeling in Atmosphere, Ocean, and Environment Studies
    • Search
    • Authors
    • Submission
    • Contacts
    • Search