Search results for: CHIP FIRING - Bridge of Knowledge

Search results for: CHIP FIRING

results on page:
embed this view on your website

Found little results, maybe try searching with alternative method.

Filters

total: 1

clear all filters disabled

Brushing with additional cleaning restrictions
Publication
- P. Borowiecki
- D. Dereniowski
- P. Prałat
- THEORETICAL COMPUTER SCIENCE - Year 2014
In graph cleaning problems, brushes clean a graph by traversing it subject to certain rules. We consider the process where at each time step, a vertex that has at least as many brushes as incident, contaminated edges, sends brushes down these edges to clean them. Various problems arise, such as determining the minimum number of brushes (called the brush number) that are required to clean the entire graph. Here, we study a new variant...

Full text available to download