A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube (Q4876698)
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 874106
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube |
scientific article; zbMATH DE number 874106 |
Statements
A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube (English)
0 references
6 May 1996
0 references
binary hypercube
0 references
parallel computation
0 references
0.94382346
0 references
0.93790716
0 references
0.9347278
0 references
0.9273751
0 references
0.92494327
0 references
0.92109275
0 references
0.9159787
0 references
0.91023713
0 references
