论文信息 - Hierarchical Broadcast Networks

Hierarchical Broadcast Networks

Abstract This paper studies the hierarchical broadcast networks, which are defined as broadcast networks whose every connected induced subgraph is also a broadcast network. We show that the minimum number of edges of a hierarchical broadcast network of order n is ⌈ n(n − 2) 2 ⌉ for any n ⩾ 4.

Pierre Fraigniaud

[1] Pierre Fraigniaud,et al. Antepenultimate broadcasting , 1995, Networks.

[2] Pierre Fraigniaud,et al. Methods and problems of communication in usual networks , 1994, Discret. Appl. Math..

[3] David Peleg,et al. Tight Bounds on Minimum Broadcast Networks , 1991, SIAM J. Discret. Math..

[4] Arthur L. Liestman,et al. A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[5] Roger Labahn. Some minimum gossip graphs , 1993, Networks.

[6] D. Du,et al. Combinatorial Network Theory , 1996 .

[7] Juraj Hromkovič,et al. Dissemination of Information in Interconnection Networks (Broadcasting & Gossiping) , 1996 .