Abstract
In this paper, we study hierarchical broadcast (respectively gossip) networks. These networks are such that every connected induced subgraph is also a broadcast (respectively gossip) network. This study follows and generalizes the study of hierarchical broadcast networks in the undirected case (cf. Fraigniaud, 1998). Here, we study broadcasting in the directed case, while gossiping is studied in the unit cost as well as the linear cost model. We prove that, for any of these three models, the minimum outdegree (respectively degree) of a directed hierarchical broadcast network (respectively hierarchical gossip network, hierarchical linear gossip network) of order n is equal to n−2.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
