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
ASCII Text
x 
 
A. Proskurowski, "Minimum Broadcast Trees," IEEE Transactions on Computers, vol. 30, no. 5, pp. 363-366, May, 1981.
 
 
BibTex
x
 
@article{ 10.1109/TC.1981.1675796,
author = {A. Proskurowski},
title = {Minimum Broadcast Trees},
journal ={IEEE Transactions on Computers},
volume = {30},
number = {5},
issn = {0018-9340},
year = {1981},
pages = {363-366},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1981.1675796},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Minimum Broadcast Trees
IS - 5
SN - 0018-9340
SP363
EP366
EPD - 363-366
A1 - A. Proskurowski,
PY - 1981
KW - tree generation
KW - Broadcasting
KW - information dissemination
VL - 30
JA - IEEE Transactions on Computers
ER -
 
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.