NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY

DOI10.1142/S0129054107004784zbMath1117.68007MaRDI QIDQ3444837

Fabrizio Luccio, Linda Pagli, Nicola Santoro

Publication date: 5 June 2007

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

trees; mobile agents; network decontamination; toroidal meshes; majority-based rule; mobile virus

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68N99: Theory of software

Related Items

Network Decontamination with Temporal Immunity by Cellular Automata, Integer programming models and algorithms for the graph decontamination problem with mobile agents, On-line search in two-dimensional environment, The power of small coalitions under two-tier majority on regular graphs, More agents may decrease global work: a case in butterfly decontamination, Network decontamination under \(m\)-immunity, An annotated bibliography on guaranteed graph searching, Triggering cascades on undirected connected graphs, Decontamination of hypercubes by mobile agents

Cites Work

• The vertex separation number of a graph equals its path-width
• A pursuit-evasion problem on a grid
• Searching and pebbling
• The complexity of searching a graph
• Monotonicity in graph searching
• Searching for a Mobile Intruder in a Polygonal Region
• Recontamination does not help to search a graph