A deterministic almost-tight distributed algorithm for approximating single-source shortest paths (Q5361854)
From MaRDI portal
scientific article; zbMATH DE number 6784095
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A deterministic almost-tight distributed algorithm for approximating single-source shortest paths |
scientific article; zbMATH DE number 6784095 |
Statements
A deterministic almost-tight distributed algorithm for approximating single-source shortest paths (English)
0 references
29 September 2017
0 references
distributed computing
0 references
derandomization
0 references
shortest paths
0 references
