On the public citation graph
Decontamination of hypercubes by mobile agents
0 signed · 56 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1994.1064openalex-snapshot
The Vertex Separation and Search Number of a Graph
inferredcites →https://doi.org/10.1007/11604655_17openalex-snapshot
Cleaning an Arbitrary Regular Network with Mobile Agents
inferredcites →https://doi.org/10.1007/11682462_45openalex-snapshot
Connected Treewidth and Connected Graph Searching
inferredcites →https://doi.org/10.1007/11780823_7openalex-snapshot
Distributed Chasing of Network Intruders by Mobile Agents
inferredcites →https://doi.org/10.1007/11917496_21openalex-snapshot
Monotony Properties of Connected Visible Graph Searching
inferredcites →https://doi.org/10.1007/3-540-45071-8_39openalex-snapshot
Isoperimetric Inequalities and the Width Parameters of Graphs
inferredcites →https://doi.org/10.1007/978-3-540-72914-3_22openalex-snapshot
Intruder Capture in Sierpiński Graphs
inferredcites →https://doi.org/10.1016/0095-8956(83)90079-5openalex-snapshot
Graph minors. I. Excluding a forest
inferredcites →https://doi.org/10.1016/0196-6774(86)90023-4openalex-snapshot
Graph minors. II. Algorithmic aspects of tree-width
inferredcites →https://doi.org/10.1016/0196-6774(91)90003-hopenalex-snapshot
Monotonicity in graph searching
inferredcites →https://doi.org/10.1016/j.disc.2005.12.011openalex-snapshot
The treewidth and pathwidth of hypercubes
inferredcites →https://doi.org/10.1016/s0304-3975(96)00177-6openalex-snapshot
Fugitive-search games on graphs and related parameters
inferredcites →https://doi.org/10.1016/s1389-1286(00)00136-5openalex-snapshot
Intrusion detection using autonomous agents
inferredcites →https://doi.org/10.1142/s0129054107004784openalex-snapshot
NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY
inferredcites →https://doi.org/10.1142/s0129054107004838openalex-snapshot
DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
inferredcites →https://doi.org/10.1145/151261.151263openalex-snapshot
Recontamination does not help to search a graph
inferredcites →https://doi.org/10.1145/42267.42268openalex-snapshot
The complexity of searching a graph
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118135617.ch3openalex-snapshot
Distributed Security Algorithms for Mobile Agents
inferred← citeshttps://doi.org/10.1002/net.21460openalex-snapshot
Integer programming models and algorithms for the graph decontamination problem with mobile agents
inferred← citeshttps://doi.org/10.1002/net.21740openalex-snapshot
Branch‐cut‐price algorithms for solving a class of search problems on general graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-11072-7_16openalex-snapshot
Graph Explorations with Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-3-030-24922-9_2openalex-snapshot
On Sense of Direction and Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-3-031-21017-4_2openalex-snapshot
Invited Paper: One Bit Agent Memory is Enough for Snap-Stabilizing Perpetual Exploration of Cactus Graphs with Distinguishable Cycles
inferred← citeshttps://doi.org/10.1007/978-3-032-17156-6_3openalex-snapshot
Monotone Decontamination of Arbitrary Dynamic Graphs with Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-3-319-16486-1_98openalex-snapshot
Black Virus Decontamination in Arbitrary Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-28472-9_16openalex-snapshot
Mobile Agents Rendezvous in Spite of a Malicious Agent
inferred← citeshttps://doi.org/10.1007/978-3-319-49259-9_31openalex-snapshot
Searching for an Evader in an Unknown Graph by an Optimal Number of Searchers
inferred← citeshttps://doi.org/10.1007/978-3-319-89441-6_17openalex-snapshot
On-line Search in Two-Dimensional Environment
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_31openalex-snapshot
Tree Decontamination with Temporary Immunity
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_30openalex-snapshot
Connected Searching of Weighted Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-15979-4_31openalex-snapshot
Network Decontamination with Temporal Immunity by Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-38233-8_20openalex-snapshot
Optimal Network Decontamination with Threshold Immunity
inferred← citeshttps://doi.org/10.1007/s00224-019-09948-6openalex-snapshot
On-line Search in Two-Dimensional Environment
inferred← citeshttps://doi.org/10.1007/s00446-009-0089-1openalex-snapshot
The cost of monotonicity in distributed graph searching
inferred← citeshttps://doi.org/10.1007/s00446-014-0236-1openalex-snapshot
Distributed graph searching with a sense of direction
inferred← citeshttps://doi.org/10.1007/s10514-010-9189-9openalex-snapshot
GSST: anytime guaranteed search
inferred← citeshttps://doi.org/10.1016/j.dam.2015.07.020openalex-snapshot
Network decontamination under m -immunity
inferred← citeshttps://doi.org/10.1016/j.ins.2020.01.037openalex-snapshot
Combinatorial trace method for network immunization
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.040openalex-snapshot
An annotated bibliography on guaranteed graph searching
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.06.017openalex-snapshot
Connected searching of weighted trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.09.027openalex-snapshot
More agents may decrease global work: A case in butterfly decontamination
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.05.002openalex-snapshot
Gathering of robots in a ring with mobile faults
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.06.042openalex-snapshot
Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers
inferred← citeshttps://doi.org/10.1109/cit/iucc/dasc/picom.2015.254openalex-snapshot
Distributed Black Virus Decontamination and Rooted Acyclic Orientations
inferred← citeshttps://doi.org/10.1109/hst47167.2019.9032941openalex-snapshot
Decontamination strategies optimized for speed of reducing dangerous levels
inferred← citeshttps://doi.org/10.1109/ipdpsw.2013.115openalex-snapshot
Network Decontamination from a Black Virus
inferred← citeshttps://doi.org/10.14569/ijacsa.2013.040415openalex-snapshot
A Review of Computation Solutions by Mobile Agents in an Unsafe Environment
inferred← citeshttps://doi.org/10.15803/ijnc.4.1_151openalex-snapshot
Decontaminating a Network from a Black Virus
inferred← citeshttps://doi.org/10.22215/etd/2016-11362openalex-snapshot
Network Decontamination from Black Viruses
inferred← citeshttps://doi.org/10.3127/ajis.v21i0.1563openalex-snapshot
Spectral Methods for Immunization of Large Networks
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.