کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
419577 683841 2010 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Parallel cleaning of a network with brushes
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 158, Issue 5, 6 March 2010, Pages 467–478
نویسندگان
, , , ,