It has been shown that an arbitrary binary tree can be embedded into a hypercube with constant expansion and constant dilation. This paper presents a simple linear-time heuristic which embeds an arbitrary binary tree into a hypercube with expansion 1 and average dilation no more than 2.
Abstract It is conjectured that an N‐vertex binary tree can be embedded into a ⌈log N⌉‐dimensional cube with a dilation of at most 2.
The technique presented in this paper is a two step process to embed all binary trees into the optimal sized hypercube. First, the tree is mapped into a member ...
This paper presents a simple linear-time heuristic which embeds an arbitrary binary tree into a hypercube with expansion 1 and average dilation no more than 2.
This paper presents a simple linear-time heuristic which embeds an arbitrary binary tree into a hypercube with expansion 1 and average dilation no more than 2.
This paper presents a simple linear-time heuristic which embeds an arbitrary binary tree into a hypercube with expansion 1 and average dilation no more than 2.
May 25, 2014 · Embedding different graphs, especially binary trees, in the hypercube has a huge literature. However, I could not find anything if we restrict ...
Oct 22, 2024 · We develop novel algorithms to facilitate the embedding job when the Flexible Hypercube contains faulty nodes. We present strategies for ...
It is not known if every binary tree is a subgraph of an O(N)-node hypercube. Mayr [26] examined parallel algorithms which efficiently compute our embeddings.
The tree edges are oriented from the root to the leaves, while the orientation of the cube edges is induced by the direction from 0 to 1 in the coordinatewise ...