Monotone decontamination of arbitrary dynamic graphs with mobile agents

DOI10.1007/978-3-032-17156-6_3MaRDI QIDQ7307304zbMATH OpenFDO

Authors Rajashree Bar, Daibik Barik, Adri Bhattacharya, P. S. Mandal

Publication date 31 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-17156-6_3

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• Black hole search in dynamic cactus graph
• DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
• Decontamination of hypercubes by mobile agents
• Feedback arc set. A history of the problem and algorithms
• Gathering in dynamic rings
• scientific article; zbMATH DE number 3650583 (Why is no real title available?)
• scientific article; zbMATH DE number 3590298 (Why is no real title available?)
• Interval graphs and searching
• Monotonicity in graph searching
• NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY
• Network decontamination under m-immunity
• The complexity of searching a graph

This page was built for publication: Monotone decontamination of arbitrary dynamic graphs with mobile agents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307304)