An efficient heuristic for broadcasting in networks

@article{Harutyunyan2006AnEH,
  title={An efficient heuristic for broadcasting in networks},
  author={Hovhannes A. Harutyunyan and Bin Shao},
  journal={J. Parallel Distrib. Comput.},
  year={2006},
  volume={66},
  pages={68-76}
}
In this paper, we present a heuristic for broadcasting in arbitrary networks. This heuristic generates optimal broadcast time for ring, tree and grid graphs when the originator is a corner vertex. In practice, the new heuristic outperforms the best known broadcast algorithms for three different network models. The time complexity of one round of the… CONTINUE READING