Constructing edge-disjoint spanning trees in 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.
edge-disjoint spanning trees locally twisted cubes data broadcasting design and analysis of algorithms graph-theoretic interconnection networks