Graph algorithms on a tree-structured parallel computer (Q797290)
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: Graph algorithms on a tree-structured parallel computer |
scientific article; zbMATH DE number 3868638
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph algorithms on a tree-structured parallel computer |
scientific article; zbMATH DE number 3868638 |
Statements
Graph algorithms on a tree-structured parallel computer (English)
0 references
1984
0 references
SIMD computer
0 references
systolic computer
0 references
graph algorithm
0 references
time complexity
0 references
Parallel algorithms
0 references
tree-structured computer
0 references
connected components
0 references
transitive closure
0 references
minimum spanning tree
0 references
0 references
0.8605687618255615
0 references
0.8485861420631409
0 references
