Network decontamination with a single agent

DOI10.1007/s00373-015-1579-5zbMath1339.05372arXiv1307.7307OpenAlexW2090860575MaRDI QIDQ292259

Asif Jamshed, Mudassir Shabbir, Yassine Daadaa

Publication date: 13 June 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.7307

zbMATH Keywords

graph searchdecontamination with immunitynetwork decontaminationpursuit evasion

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Combinatorial trace method for network immunization

Cites Work

• Unnamed Item
• Unnamed Item
• Compressions and isoperimetric inequalities
• Edge-isoperimetric inequalities in the grid
• Chasing a Fast Robber on Planar Graphs and Random Graphs
• Pebbling in Hypercubes
• Tree Decontamination with Temporary Immunity
• The complexity of searching a graph
• A Separator Theorem for Planar Graphs
• On the Problem of Partitioning Planar Graphs
• Fault-Local Distributed Mending
• Tight Fault Locality
• Network Decontamination with Temporal Immunity by Cellular Automata
• Recontamination does not help to search a graph

This page was built for publication: Network decontamination with a single agent