On the Termination of Flooding

Walter Hussak & Amitabh Trehan
Flooding is among the simplest and most fundamental of all graph/network algorithms. Consider a (distributed network in the form of a) finite undirected graph G with a distinguished node v that begins flooding by sending copies of the same message to all its neighbours and the neighbours, in the next round, forward the message to all and only the neighbours they did not receive the message from in that round and so on. We assume...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.