A note on the parallel cleaning of cliques

zbMATH Open1468.90035arXiv1912.12992MaRDI QIDQ4995331FDOQ4995331

Authors: Alejandro Angeli Ayello, Margaret-Ellen Messinger 

Publication date: 23 June 2021

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.

Full work available at URL: https://arxiv.org/abs/1912.12992

Recommendations

• Parallel cleaning of a network with brushes
• Cleaning a network with brushes
• Brushing with additional cleaning restrictions
• Brushing without capacity restrictions
• Cleaning random graphs with brushes

zbMATH Keywords

graph searchinggraph cleaning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cited In (2)

• Parallel cleaning of a network with brushes
• How often should you clean your room?

This page was built for publication: A note on the parallel cleaning of cliques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4995331)