Parallel asynchronous label-correcting methods for shortest paths (Q1908632)
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 label-correcting methods for shortest paths |
scientific article; zbMATH DE number 851099
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel asynchronous label-correcting methods for shortest paths |
scientific article; zbMATH DE number 851099 |
Statements
Parallel asynchronous label-correcting methods for shortest paths (English)
0 references
6 August 1996
0 references
shortest path problems
0 references
parallel asynchronous implementations
0 references
label-correcting methods
0 references
shared-memory multiprocessor
0 references
0 references
0.906506597995758
0 references
0.8194222450256348
0 references
0.8176525235176086
0 references
0.8127120733261108
0 references
0.8105746507644653
0 references
