Issue No. 04 - April (2007 vol. 18)
This paper is concerned with a particular family of regular 4-connected graphs, called chordal rings. Chordal rings are a variation of ring networks. By adding two extra links (or chords) at each vertex in a ring network, the reliability and fault-tolerance of the network are enhanced. Two spanning trees on a graph are said to be independent if they are rooted at the same vertex, say, r, and for each vertex vner, the two paths from r to v, one path in each tree, are internally disjoint. A set of spanning trees on a given graph is said to be independent if they are pairwise independent. Iwasaki et al. (1999) proposed a linear time algorithm for finding four independent spanning trees on a chordal ring. In this paper, we give a new linear time algorithm to generate four independent spanning trees with a reduced height in each tree. Moreover, a complete analysis of our improvements on the heights of independent spanning trees is also provided
trees (mathematics), computational complexity, fault tolerance, multiprocessor interconnection networks, network topology, linear time algorithm, independent spanning tree height reduction, chordal rings, regular 4-connected graphs, ring network reliability, ring network fault-tolerance
"[Front cover]," in IEEE Transactions on Parallel & Distributed Systems, vol. 18, no. , pp. c1, 2007.