Faster Parameterized Broadcasting

Édouard Bonnet, Carl Feghali, Manolis Vasilakis

Given a connected graph $G$ and a source $s\in V(G)$, what is the smallest number of rounds necessary for all vertices of $G$ to receive a message initially only held by $s$, wher…