Balanced spanning trees in complete and incomplete star graphs

Tzung-Shi Chen, Yu-Chee Tseng, Jang-Ping Sheu
1996 IEEE Transactions on Parallel and Distributed Systems  
Efficiently solving the personalized broadcast problem in an interconnection network typically relies on finding an appropriate spanning tree in the network. In this paper, we show how to construct in a complete star graph an asymptotically balanced spanning tree, and in an incomplete star graph a near-balanced spanning tree. In both cases, the tree is shown to have the minimum height. In the literature, this problem has only been considered for the complete star graph, and the constructed tree
more » ... is about 4/3 times taller than the one proposed in this paper. Index Terms-Balanced spanning tree, interconnection network, parallel architecture, personalized broadcast, star graph. T . 4 . Chen is with the
doi:10.1109/71.508251 fatcat:5ep55f6ubveazfaxuxbs7oy2c4