Parallel breadth-first search algorithms for trees and graphs (Q3318124): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1080/00207168408803413 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2140391860 / rank | |||
Normal rank |
Revision as of 15:30, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Parallel breadth-first search algorithms for trees and graphs |
scientific article |
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