This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seventh International Conference on Information Visualization (IV'03)
A Heuristic for k-Broadcasting in Arbitrary Networks
London, England
July 16-July 18
ISBN: 0-7695-1988-1
Hovhannes A. Harutyunyan, Concordia University
Bin Shao, Concordia University
In this paper, we present a heuristic algorithm for k-broadcasting in an arbitrary network. This heuristic generates optimal k-broadcast time in grid graph when k \ge 2. In two-dimensional torus graph, it also generates optimal k-broadcast time when k \ge 3, while giving a bound of \left[ {\frac{m} {2}} \right] + \left[ {\frac{n} {2}} \right] + 1 when k = 2, where m and n are the number of rows and columns in the graph. In practice, the new heuristic outperforms best known 1-broadcast algorithm for three different network design models. The new algorithm runs fast. The time complexity of the algorithm is O(R \cdot m), where R represents the rounds of broadcasting, and m stands for the total number of edges in the graph.
Citation:
Hovhannes A. Harutyunyan, Bin Shao, "A Heuristic for k-Broadcasting in Arbitrary Networks," iv, pp.287, Seventh International Conference on Information Visualization (IV'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.