A parallel search algorithm for directed acyclic graphs (Q795509)
From MaRDI portal
!
WARNING
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 3862454
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A parallel search algorithm for directed acyclic graphs |
scientific article; zbMATH DE number 3862454 |
Statements
A parallel search algorithm for directed acyclic graphs (English)
0 references
1984
0 references
antilexicographic
0 references
spanning tree
0 references
parallel algorithm
0 references
depth-first searching
0 references
directed acyclic graph
0 references
shared memory model
0 references
SIMD
0 references
traversal algorithms
0 references
0.7839064598083496
0 references
0.7704457640647888
0 references
0.75949627161026
0 references
