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 this page instead for the normal view: Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs |
scientific article; zbMATH DE number 529951
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
