Δ-stepping: a parallelizable shortest path algorithm (Q4820907)
From MaRDI portal
scientific article; zbMATH DE number 2105507
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
