Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
The 4-star graph is not a subgraph of any hypercube
Information Processing Letters
A broadcasting algorithm in star graph interconnection networks
Information Processing Letters
An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Optimal Broadcasting on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
A Comparative Study of Topological Properties of Hypercubes and Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Incomplete Star: An Incrementally Scalable Network Based on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Communication Aspects of the Star Graph Interconnection Network
IEEE Transactions on Parallel and Distributed Systems
Recursive Cube of Rings: A New Topology for Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Optimally Balanced Spanning Tree of the Star Network
IEEE Transactions on Computers
Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees
IEEE Transactions on Computers
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures
IEEE Transactions on Parallel and Distributed Systems
Broadcasting on incomplete star graph interconnection networks
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Optimal broadcasting on incomplete star graph interconnection networks
Journal of Systems Architecture: the EUROMICRO Journal
Perfect load balancing on the star interconnection network
The Journal of Supercomputing
| Hi-index | 0.01 |
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.