Decontamination of hypercubes by mobile agents

DOI10.1002/net.20240zbMath1194.68236OpenAlexW4239155994WikidataQ57832114 ScholiaQ57832114MaRDI QIDQ3184603

Miao Jun Huang, Paola Flocchini, Flaminia L. Luccio

Publication date: 21 October 2009

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20240

zbMATH Keywords

hypercubedistributed algorithmsmobile agentsgraph searchnetwork decontaminationintruder captureinter connection networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Games involving graphs (91A43) Agent technology and artificial intelligence (68T42)

Related Items (14)

Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers ⋮ The cost of monotonicity in distributed graph searching ⋮ More agents may decrease global work: a case in butterfly decontamination ⋮ Integer programming models and algorithms for the graph decontamination problem with mobile agents ⋮ Combinatorial trace method for network immunization ⋮ Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles ⋮ Network decontamination under \(m\)-immunity ⋮ An annotated bibliography on guaranteed graph searching ⋮ Gathering of robots in a ring with mobile faults ⋮ Connected graph searching ⋮ Network Decontamination with Temporal Immunity by Cellular Automata ⋮ Connected searching of weighted trees ⋮ On-line search in two-dimensional environment ⋮ Distributed graph searching with a sense of direction

Cites Work

• Unnamed Item
• The treewidth and pathwidth of hypercubes
• Graph minors. I. Excluding a forest
• The vertex separation and search number of a graph
• Fugitive-search games on graphs and related parameters
• Searching and pebbling
• Isoperimetric Inequalities and the Width Parameters of Graphs
• NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY
• DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
• Graph minors. II. Algorithmic aspects of tree-width
• The complexity of searching a graph
• Monotonicity in graph searching
• Dedekind Sums and Noncongruence Subgroups of the Hecke Groups G(√2) and G(√3)
• Recontamination does not help to search a graph

This page was built for publication: Decontamination of hypercubes by mobile agents