Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Optimal communication algorithms for hypercubes
Journal of Parallel and Distributed Computing
Decomposing a star graph into disjoint cycles
Information Processing Letters
Fault tolerant routing in the star and pancake interconnection networks
Information Processing Letters
Fault tolerance of the star graph interconnection network
Information Processing Letters
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Balanced Spanning Trees in Complete and Incomplete Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Optimal Information Dissemination in Star and Pancake Networks
IEEE Transactions on Parallel and Distributed Systems
Selection, routing, and sorting on the star graph
Journal of Parallel and Distributed Computing
Optimal Polling in Communication Networks
IEEE Transactions on Parallel and Distributed Systems
Optimal Parallel Routing in Star Networks
IEEE Transactions on Computers
Fault Tolerant Algorithms for Broadcasting on the Star Graph Network
IEEE Transactions on Computers
Minimum time broadcast in faulty star networks
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance
IEEE Transactions on Computers
Embedding Star Networks into Hypercubes
IEEE Transactions on Computers
A Comparative Study of Topological Properties of Hypercubes and Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures
IEEE Transactions on Parallel and Distributed Systems
Nearly Optimal One-to-Many Parallel Routing in Star Networks
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 14.98 |
The one-to-all personalized broadcast problem in an interconnection network can be optimally solved with respect to both the time and the number of transmissions if it is possible to construct an optimally balanced spanning tree of the network which is also a shortest path tree. In this paper, we give an algorithm to construct an optimally balanced spanning tree of the star network which is also a shortest path tree. Our result is optimal and improves on [10], [11].