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 this page instead for the normal view: A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube |
scientific article; zbMATH DE number 874106
Language | Label | Description | Also known as |
---|---|---|---|
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