This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Minimum Broadcast Trees
May 1981 (vol. 30 no. 5)
pp. 363-366
A. Proskurowski, Department of Computer and Information Science, University of Oregon
"Broadcasting" is an information dissemination process in which a member of a system generates a message communicated to all other members. We model this process by ordered rooted trees and investigate a special class of rooted trees allowing broadcasting from the root to all other vertices of the tree in the minimum time (over all rooted trees with n vertices). We characterize trees from this class ("mbt") and give an algorithm deciding membership in the class. We also present an algorithm to construct all mbt's with a given number of vertices and give a recursive formula to count these trees.
Index Terms:
tree generation, Broadcasting, information dissemination
Citation:
A. Proskurowski, "Minimum Broadcast Trees," IEEE Transactions on Computers, vol. 30, no. 5, pp. 363-366, May 1981, doi:10.1109/TC.1981.1675796
Usage of this product signifies your acceptance of the Terms of Use.