Finding the \(k\) shortest paths in parallel (Q5048947)
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 7614490
| 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 7614490 |
Statements
Finding the k shortest paths in parallel (English)
0 references
9 November 2022
0 references
parallel algorithms
0 references
data structures
0 references
0 references
0.9992714524269104
0 references
0.8525472283363342
0 references
0.8460667133331299
0 references
0.8074004650115967
0 references
