| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429245 | Information Processing Letters | 2006 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
