期刊
THEORETICAL COMPUTER SCIENCE
卷 410, 期 8-10, 页码 926-932出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.tcs.2008.12.025
关键词
Data broadcasting; Design and analysis of algorithms; Edge-disjoint spanning trees; Graph-theoretic interconnection networks; Locally twisted cubes
The use of edge-disjoint spanning trees for data broadcasting and scattering problem in networks provides a number of advantages, including the increase of bandwidth and fault-tolerance. In this paper, we present an algorithm for constructing n edge-disjoint spanning trees in an n-dimensional locally twisted cube. Since the n-dimensional locally twisted cube is regular with the common degree n, the number of constructed trees is optimal. (C) 2008 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据