k-broadcasting in trees

Authors
Harutyunyan, HA Liestman, AL
Citation
Ha. Harutyunyan et Al. Liestman, k-broadcasting in trees, NETWORKS, 38(3), 2001, pp. 163-168
Citations number
17
Categorie Soggetti
Computer Science & Engineering
Journal title
NETWORKS
ISSN journal
00283045 → ACNP
Volume
38
Issue
3
Year of publication
2001
Pages
163 - 168
Database
ISI
SICI code
0028-3045(200110)38:3<163:KIT>2.0.ZU;2-I
Abstract
We continue the investigation of k-broadcasting, a variant of broadcasting in which an informed vertex can call up to k of its neighbors in each time unit. We focus on k-broadcasting in trees. In particular, we asymptotically determine the maximum number of vertices in any tree with given k-broadcas t time and describe the structure of the trees that achieve this maximum. ( C) 2001 John Wiley & Sons, Inc.