A Heuristic for Broadcasting

H.A. Harutyunyan and B. Shao (Canada)



In this paper, we present a heuristic algorithm for broadcasting in an arbitrary network. In practice, the heuristic works very well, and also runs very fast. The time complexity of the algorithm is O(R ยท m), where R is the rounds of broadcasting, and m is the total number of communication links in the network.

Important Links:

Go Back