Parallel implementation of the Ramalingam decremental algorithm for dynamic updating the single-sink shortest paths subgraph (Q2882945)
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: Parallel implementation of the Ramalingam decremental algorithm for dynamic updating the single-sink shortest paths subgraph |
scientific article; zbMATH DE number 6033034
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel implementation of the Ramalingam decremental algorithm for dynamic updating the single-sink shortest paths subgraph |
scientific article; zbMATH DE number 6033034 |
Statements
11 May 2012
0 references
associative parallel machine
0 references
directed weighted graph
0 references
single-sink shortest path problem
0 references
Parallel implementation of the Ramalingam decremental algorithm for dynamic updating the single-sink shortest paths subgraph (English)
0 references
0.9673790335655212
0 references
0.948876142501831
0 references
0.9095929861068726
0 references
0.8529164791107178
0 references
0.8482609391212463
0 references
