A Note on the Parallel Cleaning of Cliques
Alejandro Angeli Ayello, Margaret-Ellen Messinger · arXiv (Cornell University) · 2019
We disprove a conjecture proposed in [Gaspers et al., Discrete Applied Mathematics, 2010] and provide a new upper bound for the minimum number of brushes required to continually parallel clean a clique.