Brushing with additional cleaning restrictions
نویسندگان
چکیده
منابع مشابه
Brushing with additional cleaning restrictions
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 en...
متن کاملBrushing without capacity restrictions
In graph cleaning problems, brushes clean a graph by traversing it subject to certain rules. Various problems arise, such as determining the minimum number of brushes that are required to clean the entire graph. This number is called the brushing number. Here, we study a new variant of the brushing problem in which one vertex is cleaned at a time, but more than one brush may traverse a dirty ed...
متن کاملGeneralized Pattern Avoidance with Additional Restrictions
Babson and Steingŕımsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We consider n-permutations that avoid the generalized pattern 1-32 and whose k rightmost letters form an increasing subword. The number of such permutations is a linear combination of Bell numbers. We find a bijection between...
متن کاملTooth brushing, tongue cleaning and snacking behaviour of dental technology and therapist students
OBJECTIVE To determine the tooth brushing, tongue cleaning and snacking behaviour of dental technology and therapist students. METHODS A descriptive cross-sectional study of students of Federal School of Dental Therapy and Technology Enugu, Nigeria. Self-administered questionnaire was used to obtain information on demography, frequency, duration and technique of tooth brushing and tongue clea...
متن کاملCompound Brushing
This paper proposes a conceptual model called compound brushing for modeling the brushing techniques used in dynamic data visualization. In this approach brushing techniques are modeled as higraphs with five types of basic entities: data, selection, device, renderer, and transformation. Using this model, a flexible visual programming tool is designed not only to configure/control various common...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.09.005