Nearly Work-Efficient Parallel Algorithm for Digraph Reachability (Q5129233)
From MaRDI portal
scientific article; zbMATH DE number 7266064
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nearly Work-Efficient Parallel Algorithm for Digraph Reachability |
scientific article; zbMATH DE number 7266064 |
Statements
Nearly Work-Efficient Parallel Algorithm for Digraph Reachability (English)
0 references
26 October 2020
0 references
parallel algorithms
0 references
randomized algorithms
0 references
graph search
0 references
reachability
0 references
shortcuts
0 references
