Network decontamination under \(m\)-immunity
type: Item
instance of: scholarly article
title: Network decontamination under \(m\)-immunity
zbMATH Open document ID: 1329.05269
author: P. Flocchini
author: Fabrizio Luccio
author: L. Pagli
author: N. Santoro
published in: Discrete Applied Mathematics
publication date: 2016-02-04T00:00:00Z
Mathematics Subject Classification ID: 05C82
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 6539078
zbMATH Keywords: network decontamination
zbMATH Keywords: connected graph search
zbMATH Keywords: monotone algorithms
zbMATH Keywords: immunity
zbMATH Keywords: meshes
zbMATH Keywords: tori
MaRDI profile type: Publication
full work available at URL: j.dam.2015.07.020
OpenAlex ID: W1659542177
cites work: Connected graph searching
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Q4035355
cites work: Monotonicity in graph searching
cites work: Distributed chasing of network intruders
cites work: Network Decontamination with Temporal Immunity by Cellular Automata
cites work: Connected searching of weighted trees
cites work: Approximate search strategies for weighted trees
cites work: DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
cites work: Decontamination of hypercubes by mobile agents
cites work: Tree Decontamination with Temporary Immunity
cites work: An annotated bibliography on guaranteed graph searching
cites work: Connected Graph Searching in Outerplanar Graphs
cites work: The cost of monotonicity in distributed graph searching
cites work: Capturing an intruder in product networks
cites work: The vertex separation number of a graph equals its path-width
cites work: Searching and pebbling
cites work: Recontamination does not help to search a graph
cites work: Contiguous search problem in Sierpiński graphs
cites work: NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY
cites work: The complexity of searching a graph
cites work: A pursuit-evasion problem on a grid
cites work: Connected graph searching in chordal graphs
cites work: Graph searching with advice
cites work: Q4159394
cites work: Local majorities, coalitions and monopolies in graphs: A review
cites work: Design and Analysis of Distributed Algorithms
cites work: Capturing an Intruder in the Pyramid
cites work: Sweeping graphs with large clique number
DOI: 10.1016/J.DAM.2015.07.020
description: scientific article; zbMATH DE number 6539078