k-broadcasting in trees
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-broadcast time and describe the structure of the trees that achieve this maximum. (C) 2001 John Wiley & Sons, Inc.
k-broadcast broadcast trees