Wyniki wyszukiwania dla: CHIP FIRING

• Brushing with additional cleaning restrictions

  Publikacja

  • P. Borowiecki
  • D. Dereniowski
  • P. Prałat

  - THEORETICAL COMPUTER SCIENCE - Rok 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...

  Pełny tekst do pobrania w portalu