Open Access
2008 An Efficient Vertex Addition Method for Broadcast Networks
Hovhannes A. Harutyunyan
Internet Math. 5(3): 211-225 (2008).


Broadcasting is a basic problem of communication in usual networks. Many papers have investigated the construction of minimum broadcast networks, the cheapest possible broadcast network architecture (having the fewest communication lines), in which broadcasting can be accomplished as fast as theoretically possible from any vertex. Since this problem is very difficult, numerous papers have investigated ways to construct sparse networks in which broadcasting can be completed in minimum time from any originator. In this paper we introduce an efficient vertex addition method that allows us to construct sparse networks and improve the best known upper bounds on the broadcast function $B(n)$ for many odd values of $n$. We also give the exact value of $B(127)$.


Download Citation

Hovhannes A. Harutyunyan. "An Efficient Vertex Addition Method for Broadcast Networks." Internet Math. 5 (3) 211 - 225, 2008.


Published: 2008
First available in Project Euclid: 24 November 2009

zbMATH: 1184.68033
MathSciNet: MR2573953

Rights: Copyright © 2008 A K Peters, Ltd.

Vol.5 • No. 3 • 2008
Back to Top