Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

ASSOCIATIVE PARALLEL ALGORITHM FOR DYNAMIC UPDATE OF SHORTEST PATHS TREE AFTER INSERTING AN ARC

From MaRDI portal
Publication:5151289
Jump to:navigation, search

DOI10.17223/20710410/46/5zbMath1458.68277OpenAlexW3003643880MaRDI QIDQ5151289

Tat'Yana V. Snytnikova, A. Sh. Nepomnyashchaya

Publication date: 17 February 2021

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm684


zbMATH Keywords

adjacency matrixincremental algorithmassociative parallel processororiented weighted graphvertical data processingaffected vertex


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)




Cites Work

  • SOLUTION OF GRAPH PROBLEMS BY MEANS OF THE STAR-MACHINE BEING IMPLEMENTED ON GPUS
  • A comparison of associative computation models
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: ASSOCIATIVE PARALLEL ALGORITHM FOR DYNAMIC UPDATE OF SHORTEST PATHS TREE AFTER INSERTING AN ARC

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5151289&oldid=19696870"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 14:55.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki