论文信息 - Embedding complete ternary trees into hypercubes

Embedding complete ternary trees into hypercubes

We inductively describe an embedding of a complete ternary tree T h of height h into a hypercube Q of dimension at most (1.6)h + 1 with load 1, dilation 2, node congestion 2 and edge congestion 2. This is an improvement over the known embedding of T h into Q. And it is very close to a conjectured embedding of Havel [3] which states that there exists an embedding of T h into its optimal hypercube with load 1 and dilation 2. The optimal hypercube has dimension (log 2 3)h (= (1.585)h) or (log 2 3)h + 1.

Sheshayya A. Choudum | S. Lavanya

[1] Pavel Tvrdík,et al. Embedding of k-ary Complete Trees into Hypercubes with Uniform Load , 1998, J. Parallel Distributed Comput..

[2] Angela Y. Wu,et al. Embedding of tree networks into hypercubes , 1985, J. Parallel Distributed Comput..

[3] Hong Wang,et al. Efficient embeddings of ternary trees into hypercubes , 2003, J. Parallel Distributed Comput..

[4] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[5] Weifa Liang,et al. Embedding K-ary Complete Trees into Hypercubes , 1995, J. Parallel Distributed Comput..

[6] Sergei L. Bezrukov. Embedding complete trees into the hypercube , 2001, Discret. Appl. Math..

[7] Sajal K. Das,et al. Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.

[8] Burkhard Monien,et al. Embedding one interconnection network in another , 1990 .