Contents

-

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

A note on the parallel cleaning of cliques

A. Angeli Ayello 1, M. E. Messinger 2
1Department of Mathematics, ETH Zurich, Zurich, Switzerland
2Department of Mathematics and Computer Science, Mount Allison University, Sackville, NB, Canada

Abstract

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.
Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.