Parallel cleaning of a network with brushes

We consider the process of cleaning a network where at each time step, all vertices that have at least as many brushes as incident, contaminated edges, send brushes down these edges and remove them from the network. An added condition is that, because of the contamination model used, the final configuration must be the initial configuration of another cleaning of the network. We find the minimum number of brushes required for trees, cycles, complete bipartite networks; and for all networks when all edges must be cleaned on each step. Finally, we give bounds on the number of brushes required for complete networks.

• Type: Journal
• Year: 2010
• Where: DAM
• Authors: Serge Gaspers, Margaret-Ellen Messinger, Richard J. Nowakowski, Pawel Pralat
• Keywords: Added Condition, Brushes, Cleaning, DAM 2010