Finding the \(k\) shortest paths in parallel (Q1580964)
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: Finding the k shortest paths in parallel |
scientific article; zbMATH DE number 1507965
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding the \(k\) shortest paths in parallel |
scientific article; zbMATH DE number 1507965 |
Statements
Finding the \(k\) shortest paths in parallel (English)
0 references
14 September 2000
0 references
PRAM algorithm
0 references
0.9992714524269104
0 references
0.8518677353858948
0 references
0.8493985533714294
0 references
0.809817373752594
0 references
