Associative version of the Ramalingam incremental algorithm for the dynamic all-pairs shortest-path problem (Q4553629)
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 6969033
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Associative version of the Ramalingam incremental algorithm for the dynamic all-pairs shortest-path problem |
scientific article; zbMATH DE number 6969033 |
Statements
30 October 2018
0 references
directed weighted graph
0 references
incremental algorithm
0 references
associative parallel processor
0 references
data access by contents
0 references
time complexity
0 references
0.9330336451530457
0 references
0.922011137008667
0 references
0.8593369126319885
0 references
0.8529164791107178
0 references
