Journal
THEORETICAL COMPUTER SCIENCE
Volume 410, Issue 8-10, Pages 926-932Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.tcs.2008.12.025
Keywords
Data broadcasting; Design and analysis of algorithms; Edge-disjoint spanning trees; Graph-theoretic interconnection networks; Locally twisted cubes
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available