Parallel search algorithms for graphs and trees (Q1204800)
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: Parallel search algorithms for graphs and trees |
scientific article; zbMATH DE number 130911
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel search algorithms for graphs and trees |
scientific article; zbMATH DE number 130911 |
Statements
Parallel search algorithms for graphs and trees (English)
0 references
29 March 1993
0 references
parallel random access machine
0 references
parallel algorithms
0 references
tree traversal
0 references
breadth-first search
0 references
shortest paths
0 references
depth-first search
0 references
directed acyclic graphs
0 references
planar graphs
0 references
spanning trees
0 references
forests
0 references
decomposition search
0 references
0 references
