Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:03, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs |
scientific article |
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
