Nearly work-efficient parallel algorithm for digraph reachability (Q5230310)
From MaRDI portal
scientific article; zbMATH DE number 7097017
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nearly work-efficient parallel algorithm for digraph reachability |
scientific article; zbMATH DE number 7097017 |
Statements
Nearly work-efficient parallel algorithm for digraph reachability (English)
0 references
22 August 2019
0 references
parallel algorithm
0 references
graph search
0 references
randomized algorithm
0 references
reachability
0 references
shortcuts
0 references
