Degree- and time-constrained broadcast networks

Michael J. Dinneen, Geoffrey Pritchard, Mark C. Wilson
2002 Networks  
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