Parallel breadth-first search algorithms for trees and graphs (Q3318124)
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 breadth-first search algorithms for trees and graphs |
scientific article; zbMATH DE number 3848624
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel breadth-first search algorithms for trees and graphs |
scientific article; zbMATH DE number 3848624 |
Statements
Parallel breadth-first search algorithms for trees and graphs (English)
0 references
1984
0 references
Parallel Breadth-First Search algorithms
0 references
parallel algorithm
0 references
atomic tree
0 references
time complexity
0 references
SIMD
0 references
ordered trees
0 references
shared memory model
0 references
Single Instruction-stream Multiple Data-stream computer
0 references
Breadth-First Spanning Trees
0 references
directed graph
0 references
undirected graph
0 references
0.8993172645568848
0 references
0.8782727718353271
0 references
0.8534883856773376
0 references
