Publication: Parallel Cleaning of a Network with Brushes
All
 By Area
 By Year
Title 
Parallel Cleaning of a Network with Brushes

Authors/Editors* 
S.Gaspers, M.E.Messinger, R.J.Nowakowski, and P.Pralat

Where published* 
Discrete Applied Mathematics 
How published* 
Journal 
Year* 
2010 
Volume 
158 
Number 

Pages 
467478 
Publisher 

Keywords 

Link 
http://www.math.ryerson.ca/~pralat/research.html 
Abstract

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. 
Go to Mathematical Modeling & Simulation
Back to page 29 of list
