| Article ID: | iaor20032479 |
| Country: | United States |
| Volume: | 39 |
| Issue: | 3 |
| Start Page Number: | 121 |
| End Page Number: | 129 |
| Publication Date: | Apr 2002 |
| Journal: | Networks |
| Authors: | Pritchard Geoffrey, Wilson Mark C., Dinneen Michael J. |
| Keywords: | graphs |
We consider the problem of constructing networks with as many nodes as possible, subject to upper bounds on the degree and broadcast time. This paper includes the results of an extensive empirical study of broadcasting in small regular graphs using a stochastic search algorithm to approximate the broadcast time. Significant improvements on known results are obtained for cubic broadcast networks.