
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
Seventh International Conference on Information Visualization (IV'03)
A Heuristic for kBroadcasting in Arbitrary Networks
London, England
July 16July 18
ISBN: 0769519881
ASCII Text  x  
Hovhannes A. Harutyunyan, Bin Shao, "A Heuristic for kBroadcasting in Arbitrary Networks," 2013 17th International Conference on Information Visualisation, pp. 287, Seventh International Conference on Information Visualization (IV'03), 2003.  
BibTex  x  
@article{ 10.1109/IV.2003.1217992, author = {Hovhannes A. Harutyunyan and Bin Shao}, title = {A Heuristic for kBroadcasting in Arbitrary Networks}, journal ={2013 17th International Conference on Information Visualisation}, volume = {0}, year = {2003}, issn = {10939547}, pages = {287}, doi = {http://doi.ieeecomputersociety.org/10.1109/IV.2003.1217992}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  2013 17th International Conference on Information Visualisation TI  A Heuristic for kBroadcasting in Arbitrary Networks SN  10939547 SP EP A1  Hovhannes A. Harutyunyan, A1  Bin Shao, PY  2003 KW  null VL  0 JA  2013 17th International Conference on Information Visualisation ER   
In this paper, we present a heuristic algorithm for kbroadcasting in an arbitrary network. This heuristic generates optimal kbroadcast time in grid graph when k \ge 2. In twodimensional torus graph, it also generates optimal kbroadcast 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 1broadcast 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 kBroadcasting 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.