Answers are grounded in this paper and cite their sources.
Broadcasting is an information dissemination process in which a message is to be sent from a single originator to all members of a network by placing calls over the communication lines of the network. Several previous papers have investigated ways to construct sparse graphs (networks) in which this process can be completed in minimum time from any originator. The graphs produced by these methods contain high degree vertices. This paper describes graphs with fixed maximum degree in which broadcasting can be completed in near minimum time.
No takes yet. Share an insight, caveat, or question.
Liestman et al. (1988) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: