Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0022-0000(93)90042-u / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4242757385 / rank | |||
Normal rank | |||
Latest revision as of 10:21, 30 July 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
0 references
0 references
0 references
