p.49
p.54
p.58
p.64
p.70
p.76
p.82
p.88
p.93
Embedding Complete Binary Trees into Locally Twisted Cubes
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.
Info:
Periodical:
Pages:
70-75
Citation:
Online since:
September 2012
Authors:
Permissions:
Share:
Citation: