Parallel asynchronous algorithms for the \(K\) shortest paths problem (Q1973483)
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 asynchronous algorithms for the K shortest paths problem |
scientific article; zbMATH DE number 1437156
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel asynchronous algorithms for the \(K\) shortest paths problem |
scientific article; zbMATH DE number 1437156 |
Statements
Parallel asynchronous algorithms for the \(K\) shortest paths problem (English)
0 references
27 April 2000
0 references
\(K\) shortest paths problems
0 references
label-correcting methods
0 references
parallel asynchronous algorithms
0 references
shared memory
0 references
nonuniform memory
0 references
access (NUMA) multiprocessor
0 references
0.910310685634613
0 references
0.8525472283363342
0 references
0.8518677353858948
0 references
0.8298038840293884
0 references
