Embedding Complete Binary Trees into Locally Twisted Cubes

Article Preview

Abstract:

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.

You have full access to the following eBook

Info: