Parallel breadth-first search algorithms for trees and graphs (Q3318124): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4172077 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4195963 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Characterizations of Reducible Flow Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4057549 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: New Parallel-Sorting Schemes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel Computations in Graph Theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank | |||
Latest revision as of 12:12, 14 June 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
