In this paper, we present a simple one-to-one embedding of arbitrary binary trees into their optimal hypercubes with dilation 8 and constant node-congestion.
In this paper, we present a simple one-to-one embedding of arbitrary binary trees into their optimal hypercubes with dilation 8 and constant node-congestion.
This paper presents a simple one-to-one embedding of arbitrary binary trees into their optimal hypercubes with dilation 8 and constant node-congestion, ...
A New Efficient Algorithm for Embedding an. Arbitrary Binary Tree into Its Optimal Hypercube. Volker Heun Ernst W. Mayr. Institut f ¨ur Informatik. Technische ...
Heun, Volker ; Mayr, Ernst W. / A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube. In: Journal of Algorithms. 1996 ; ...
V. Heun and E. W. Mayr, “A New Efficient Algorithm for Embedding ...
www.scirp.org › referencespapers
ABSTRACT: In this paper, we present an algorithm for embedding an m-sequential k-ary tree into its optimal hypercube with dilation at most 2 and prove its ...
May 28, 2017 · Volker Heun, Ernst W. Mayr: A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube.
We have given a two step algorithm for embedding all binary trees in the optimal sized hypercube with dilation two. The algorithm is the best possible in terms ...
The algorithm presented here uses migration of previously mapped tree vertices and achieves dilation 9, unit load, expansion <4 and constant node-congestion ...
The algorithm presented here uses migration of previously mapped tree vertices and achieves dilation 9, unit load, ex- pansion <4 and constant node-congestion.