Δ-stepping: a parallelizable shortest path algorithm (Q4820907)
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: Δ-stepping: a parallelizable shortest path algorithm |
scientific article; zbMATH DE number 2105507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Δ-stepping: a parallelizable shortest path algorithm |
scientific article; zbMATH DE number 2105507 |
Statements
Δ-stepping: a parallelizable shortest path algorithm (English)
0 references
1 October 2004
0 references
nonrandom edge weights
0 references
0 references
0.8929255
0 references
0 references
0 references
0.88162774
0 references
0.88162774
0 references
