DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS

DOI10.1142/S0129054107004838zbMath1117.68006WikidataQ57832117 ScholiaQ57832117MaRDI QIDQ3444846

Miao Jun Huang, Paola Flocchini, Flaminia L. Luccio

Publication date: 5 June 2007

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

zbMATH Keywords

asynchronous chordal ring networks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

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 ⋮ Decontamination of hypercubes by mobile agents ⋮ Integer programming models and algorithms for the graph decontamination problem with mobile agents ⋮ Combinatorial trace method for network immunization ⋮ Connected search for a lazy robber ⋮ Network decontamination under \(m\)-immunity ⋮ An annotated bibliography on guaranteed graph searching ⋮ Gathering of robots in a ring with mobile faults ⋮ Connected graph searching ⋮ Contiguous search problem in Sierpiński graphs ⋮ Connected searching of weighted trees ⋮ On-line search in two-dimensional environment ⋮ Distributed graph searching with a sense of direction

Cites Work

• Min Cut is NP-complete for edge weighted trees
• Efficient elections in chordal ring networks
• The vertex separation and search number of a graph
• Optimal distributed algorithms in unlabeled tori and chordal rings
• Searching and pebbling
• The complexity of searching a graph
• Recontamination does not help to search a graph

This page was built for publication: DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS