Efficient parallel implementation of the Ramalingam decremental algorithm for updating the shortest paths subgraph (Q4610076)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient parallel implementation of the Ramalingam decremental algorithm for updating the shortest paths subgraph |
scientific article; zbMATH DE number 6856295
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient parallel implementation of the Ramalingam decremental algorithm for updating the shortest paths subgraph |
scientific article; zbMATH DE number 6856295 |
Statements
5 April 2018
0 references
directed weighted graph
0 references
subgraph of the shortest paths
0 references
adjacency matrix
0 references
decremental algorithm
0 references
associative parallel processor
0 references
access data by contents
0 references
time complexity
0 references
0.9673790335655212
0 references
0.928314447402954
0 references
0.8991312384605408
0 references
0.8551443815231323
0 references
