Parallel breadth-first search and exact shortest paths and stronger notions for approximate distances (Q6499233)
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 breadth-first search and exact shortest paths and stronger notions for approximate distances |
scientific article; zbMATH DE number 7844593
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel breadth-first search and exact shortest paths and stronger notions for approximate distances |
scientific article; zbMATH DE number 7844593 |
Statements
Parallel breadth-first search and exact shortest paths and stronger notions for approximate distances (English)
0 references
8 May 2024
0 references
approximate distances
0 references
bfs
0 references
distributed algorithms
0 references
exact distances
0 references
parallel algorithms
0 references
shortest path
0 references
0 references
0 references
