Nearly work-efficient parallel algorithm for digraph reachability (Q5129233)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7266064
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.997327208518982
0 references
0.829740047454834
0 references
0.825691282749176
0 references
0.8033402562141418
0 references
0.7970248460769653
0 references
