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.
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 ...
We present a mathematical model of parallel computing in a hypercubical parallel computer. This is based on embedding binary trees or forests into the n- ...
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 corresponding construction is well known as embedding of a double-rooted complete binary tree [8] and can be done by induction on k. In the case k = 2 the ...
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 ...
Then, this strongly balanced binary tree is embedded into the optimal-sized hypercube by a “folding” algorithm. Wagner's algorithm relies on a conjecture about ...
An O(N/sup 2/) heuristic algorithm is presented that embeds all binary trees, with dilation 2 and small average dilation, into the optimal sized hypercube.
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.