Abstract
The use of edge-disjoint spanning trees or independent spanning trees in a network for data broadcasting has the benefits of increased of bandwidth and fault-tolerance. In this paper, we propose an algorithm which constructs n edge-disjoint spanning trees in the n-dimensional twisted cube, denoted by TQ n . Because the n-dimensional twisted cube is n-regular, the result is optimal with respect to the number of edge-disjoint spanning trees constructed. Furthermore, we also show that n 2 of the n edge-disjoint spanning trees constructed are independent spanning trees. This algorithm runs in time O( N log N) and can be parallelized to run in time O(log N) where N is the number of nodes in TQ n .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
