Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488)
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 529951
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs |
scientific article; zbMATH DE number 529951 |
Statements
Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (English)
0 references
18 September 1994
0 references
transitive closure
0 references
parallel algorithms
0 references
planar digraphs
0 references
digraph reachability
0 references
0 references
0 references
0 references
0.8436056971549988
0 references
0.838695764541626
0 references
0.8351912498474121
0 references
0.8319429159164429
0 references
0.825691282749176
0 references
