Associative parallel algorithm for dynamic update of shortest paths tree after inserting an arc (Q5151289)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7311680
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Associative parallel algorithm for dynamic update of shortest paths tree after inserting an arc |
scientific article; zbMATH DE number 7311680 |
Statements
ASSOCIATIVE PARALLEL ALGORITHM FOR DYNAMIC UPDATE OF SHORTEST PATHS TREE AFTER INSERTING AN ARC (English)
0 references
17 February 2021
0 references
oriented weighted graph
0 references
adjacency matrix
0 references
incremental algorithm
0 references
affected vertex
0 references
vertical data processing
0 references
associative parallel processor
0 references
0 references
0 references
0.896881639957428
0 references
0.880776584148407
0 references
0.8653572797775269
0 references
0.8593369126319885
0 references
