On the number of broadcast schemes in networks
Broadcasting is the process of spreading one piece of information among a group of individuals connected by an interconnection network. In this paper we give exact lower and upper bounds for the number of broadcast schemes in arbitrary networks. Also, we give the exact value for complete bipartite graphs and an upper bound for regular networks. Based on the counting method we describe a new random algorithm for broadcasting in networks. (c) 2006 Elsevier B.V. All rights reserved.
number of broadcast schemes interconnection networks randomly broadcasting minimum broadcast time