A Note on the Parallel Cleaning of Cliques
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.