Optimal network decontamination with threshold immunity

DOI10.1007/978-3-642-38233-8_20MaRDI QIDQ4924653zbMATH OpenOpenAlexFDO

Authors Fabrizio Luccio, L. Pagli, P. Flocchini, N. Santoro

Publication date 7 June 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38233-8_20

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Network decontamination under m-immunity
• NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY
• Network decontamination with a single agent
• Tree Decontamination with Temporary Immunity
• Decontamination of hypercubes by mobile agents

Cited in

(12)

• Network decontamination with a single agent
• Methods for removing links in a network to minimize the spread of infections
• More agents may decrease global work: a case in butterfly decontamination
• NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY
• Tree Decontamination with Temporary Immunity
• Contamination and decontamination in majority-based systems
• Network decontamination with temporal immunity by cellular automata
• Immunization of networks with limited knowledge and temporary immunity
• Decontaminating arbitrary graphs by mobile agents: a survey
• Integer programming models and algorithms for the graph decontamination problem with mobile agents
• On-line search in two-dimensional environment
• Network decontamination under m-immunity

This page was built for publication: Optimal network decontamination with threshold immunity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4924653)