Michael J. Dinneen, Geoffrey Pritchard and Mark C. Wilson, Networks 39 (2002), 1–9.
Abstract: We consider the problem of constructing networks with as many nodes as possible, subject to upper bounds on the degree and broadcast time. The 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.