A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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. Signicant improvements on known results are obtained for cubic broadcast networks.doi:10.1002/net.10018 fatcat:sgwch6t635hcnmccnskddwknai