Title :
Balanced spanning trees in complete and incomplete star graphs
Author :
Chen, Tzung-Shi ; Tseng, Yu-Chee ; Sheu, Jang-Ping
Author_Institution :
Dept. of Inf. Manage., Chang Jung Univ., Tainan, China
fDate :
7/1/1996 12:00:00 AM
Abstract :
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 is about 4/3 times taller than the one proposed in this paper
Keywords :
multiprocessor interconnection networks; parallel architectures; trees (mathematics); asymptotically balanced spanning tree; balanced spanning trees; complete star graph; complete star graphs; incomplete star graphs; interconnection network; near-balanced spanning tree; personalized broadcast problem; spanning tree; Broadcasting; Computer Society; Computer science; Hypercubes; Information management; Intelligent networks; Multiprocessor interconnection networks; Parallel architectures; Parallel processing; Tree graphs;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
