Embedding Complete Binary Trees into Locally Twisted Cubes
Yue Juan Han, Jian Xi Fan, Lan Tao You, Yan Wang · Advanced engineering forum · 2012
The locally twisted cube is a newly introduced interconnection network for parallel computing, which possesses many desirable properties. In this paper, the problem of embedding complete binary trees into locally twisted cubes is studied.Let LTQn(V;E) denote the n-dimensional locally twisted cube.We find the following result in this paper: for any integern ≥ 2,we show that a complete binary tree with 2n—1 nodes can be embedded into the LTQn with dilation 2.