Dense edge-disjoint embedding of complete binary trees in the hypercube (Q2365823)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 222813
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dense edge-disjoint embedding of complete binary trees in the hypercube |
scientific article; zbMATH DE number 222813 |
Statements
Dense edge-disjoint embedding of complete binary trees in the hypercube (English)
0 references
29 June 1993
0 references
parallel algorithms
0 references
graph embedding
0 references
complete binary tree
0 references
hybercube
0 references
0.9009658694267272
0 references
0.8995029330253601
0 references
0.8837794661521912
0 references
0.8798375725746155
0 references
