On the public citation graph

Distributed Chasing of Network Intruders by Mobile Agents

https://doi.org/10.1007/11780823_7
0 signed · 39 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11549345_32openalex-snapshot
Nondeterministic Graph Searching: From Pathwidth to Treewidth
inferredcites →https://doi.org/10.1007/11682462_45openalex-snapshot
Connected Treewidth and Connected Graph Searching
inferredcites →https://doi.org/10.1007/3-540-45253-2_37openalex-snapshot
Computing Optimal Linear Layouts of Trees in Linear Time
inferredcites →https://doi.org/10.1007/978-3-540-24749-4_22openalex-snapshot
Digraphs Exploration with Little Memory
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_49openalex-snapshot
Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In
inferredcites →https://doi.org/10.1007/978-3-540-30551-4_77openalex-snapshot
Sweeping Graphs with Large Clique Number
inferredcites →https://doi.org/10.1007/978-3-540-39890-5_4openalex-snapshot
Searching Is Not Jumping
inferredcites →https://doi.org/10.1007/bfb0070400openalex-snapshot
Pursuit-evasion in a graph
inferredcites →https://doi.org/10.1016/0012-365x(85)90046-9openalex-snapshot
Interval graphs and seatching
inferredcites →https://doi.org/10.1016/0166-218x(89)90016-4openalex-snapshot
On minimizing width in linear layouts
inferredcites →https://doi.org/10.1016/0196-6774(91)90003-hopenalex-snapshot
Monotonicity in graph searching
inferredcites →https://doi.org/10.1016/0304-3975(86)90146-5openalex-snapshot
Searching and pebbling
inferredcites →https://doi.org/10.1090/dimacs/005/02openalex-snapshot
Graph searching, path-width, tree-width and related problems (A survey)
inferredcites →https://doi.org/10.1109/ipdps.2005.151openalex-snapshot
Contiguous Search in the Hypercube for Capturing an Intruder
inferredcites →https://doi.org/10.1109/ipdps.2006.1639545openalex-snapshot
Decontamination of chordal rings and tori
inferredcites →https://doi.org/10.1137/050643350openalex-snapshot
Exact Algorithms for Treewidth and Minimum Fill-In
inferredcites →https://doi.org/10.1137/0608024openalex-snapshot
Complexity of Finding Embeddings in a k -Tree
inferredcites →https://doi.org/10.1145/1060590.1060674openalex-snapshot
Improved approximation algorithms for minimum-weight vertex separators
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
inferredcites →https://doi.org/10.1145/564870.564906openalex-snapshot
Capture of an intruder by mobile agents

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.20240openalex-snapshot
Decontamination of hypercubes by 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.1007/11947950_1openalex-snapshot
Distributed Security Algorithms by Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-3-030-11072-7_18openalex-snapshot
Dangerous Graphs
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-69084-1_16openalex-snapshot
How to Simulate Message-Passing Algorithms in Mobile Agent Systems with Faults
inferred← citeshttps://doi.org/10.1007/978-3-540-72914-3_22openalex-snapshot
Intruder Capture in Sierpiński Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_6openalex-snapshot
Graph Searching with Advice
inferred← citeshttps://doi.org/10.1007/978-3-540-77096-1_30openalex-snapshot
The Cost of Monotonicity in Distributed Graph Searching
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_39openalex-snapshot
A Self-stabilizing Algorithm for Graph Searching in Trees
inferred← citeshttps://doi.org/10.1007/s00224-008-9116-zopenalex-snapshot
Contiguous Search Problem in Sierpiński Graphs
inferred← citeshttps://doi.org/10.1007/s00446-014-0236-1openalex-snapshot
Distributed graph searching with a sense of direction
inferred← citeshttps://doi.org/10.1016/j.dam.2015.07.020openalex-snapshot
Network decontamination under m -immunity
inferred← citeshttps://doi.org/10.1016/j.ic.2012.08.004openalex-snapshot
Connected graph searching
inferred← citeshttps://doi.org/10.1109/iccgi.2007.43openalex-snapshot
On the Complexity of Decontaminating an Hexagonal Mesh Network
inferred← citeshttps://doi.org/10.1142/s0129054107004838openalex-snapshot
DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
inferred← citeshttps://doi.org/10.20381/ruor-18976openalex-snapshot
Best effort decontamination of networks
inferred← citeshttps://doi.org/10.22215/etd/2016-11362openalex-snapshot
Network Decontamination from Black Viruses
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.