3 citations · 3 across the 1 of their papers we have counts for
2 papers
cs.DC2020★ 3 cited
Terminating cases of flooding
Walter Hussak, Amitabh Trehan
Basic synchronous flooding proceeds in rounds. Given a finite undirected (network) graph , a set of sources initiate flooding in the first round by every node in…
cs.DS2019
On The Termination of a Flooding Process
Walter Hussak, Amitabh Trehan
Flooding is among the simplest and most fundamental of all distributed network algorithms. A node begins the process by sending a message to all its neighbours and the neighbours,…