Sciweavers

DAM
2016

Network decontamination under m-immunity

8 years 7 months ago
Network decontamination under m-immunity
We consider the problem of decontaminating an infected network using as few mobile cleaning agents as possible and avoiding recontamination. After a cleaning agent has left a vertex v, this vertex will become recontaminated if m or more of its neighbours are infected, where m ≥ 1 is a threshold parameter of the system indicating the local immunity level of the network. This network decontamination problem, also called monotone connected graph search and intruder capture, has been extensively studied in the literature when m = 1 (no immunity). In this paper, we extend these investigations and consider for the first time the network decontamination problem when the parameter m is an arbitrary in
Paola Flocchini, Fabrizio Luccio, Linda Pagli, Nic
Added 01 Apr 2016
Updated 01 Apr 2016
Type Journal
Year 2016
Where DAM
Authors Paola Flocchini, Fabrizio Luccio, Linda Pagli, Nicola Santoro
Comments (0)