Searching for "On Embedding Binary Trees into Hypercubes." – sorted by Relevance.
-
On Embedding Binary Trees into Hypercubes
- On Embedding Binary Trees into Hypercubes Woei-Kae Chen Department of Electronic Engineering
- Cited by 6 (1 self) – Add To MetaCart
-
Efficient Dynamic Embeddings of Binary Trees into Hypercubes
- algorithm for dynamically embedding binary trees into hypercubes is presented. Because of a known lower
- Cited by 2 (0 self) – Add To MetaCart
-
A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
- on hypercubes. In this paper, we present a simple one-to-one embedding of arbitrary binary trees
- Cited by 7 (7 self) – Add To MetaCart
-
Simulating Binary Trees on Hypercubes
- ) expansion, of every binary tree into a hypercube. Moreover, we describe an embedding of an arbitrary binary
- Cited by 13 (3 self) – Add To MetaCart
-
Novel Data Communication Algorithms on Hypercubes and Related Interconnection Networks
- that we know exact embeddings of binary trees into hypercubes, our algorithms use recursive properties
- Cited by 1 (0 self) – Add To MetaCart
-
Embedding an Arbitrary Binary Tree into the Star Graph
- here some of the important results of embedding an arbitrary binary tree into the hypercube (refer
- Cited by 3 (1 self) – Add To MetaCart
-
Dense Edge-Disjoint Embedding of Complete Binary Trees in Interconnection Networks
- -rooted complete binary tree with n 32 leaves can be embedded with unit dilation in the hypercube with n nodes, so
- Cited by 4 (0 self) – Add To MetaCart
-
Open Problems 14
- k is sufficiently large? The motivation for the question is an application [25] to embedding binary
- Add To MetaCart

