Embedding the complete tree in the hypercube (Q1325976)
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: Embedding the complete tree in the hypercube |
scientific article; zbMATH DE number 567831
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Embedding the complete tree in the hypercube |
scientific article; zbMATH DE number 567831 |
Statements
Embedding the complete tree in the hypercube (English)
0 references
26 January 1995
0 references
complete binary tree
0 references
divide-and-conquer algorithms
0 references
Boolean hypercube
0 references
spanning tree
0 references
tree-structured computation
0 references
multiprocessors
0 references
0.8938407301902771
0 references
0.8893821835517883
0 references
0.8726111650466919
0 references
