Network Decontamination with Temporal Immunity by Cellular Automata

DOI10.1007/978-3-642-15979-4_31zbMath1306.68106OpenAlexW1480664545MaRDI QIDQ4931220

Nejib Zaguia, Yassine Daadaa, Paola Flocchini

Publication date: 4 October 2010

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-15979-4_31

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Distributed systems (68M14)

Related Items (3)

Network decontamination with a single agent ⋮ Network decontamination under \(m\)-immunity ⋮ On-line search in two-dimensional environment

Cites Work

• Unnamed Item
• The cost of monotonicity in distributed graph searching
• Graph Searching and Interval Completion
• Decontamination of hypercubes by mobile agents
• NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY
• Connected Treewidth and Connected Graph Searching
• Tree Decontamination with Temporary Immunity
• The complexity of searching a graph
• Monotonicity in graph searching

This page was built for publication: Network Decontamination with Temporal Immunity by Cellular Automata