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.
Keywords: graph cleaning, graph searching.
Citation
A. Angeli Ayello, M. E. Messinger. A note on the parallel cleaning of cliques[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 116. 315-325. .
