On the public citation graph
Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search
0 signed · 32 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.1002/net.20095openalex-snapshot
Black hole search in common interconnection networks
inferredcites →https://doi.org/10.1007/11429647_17openalex-snapshot
Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs
inferredcites →https://doi.org/10.1007/11516798_5openalex-snapshot
Searching for a Black Hole in Tree Networks
inferredcites →https://doi.org/10.1007/3-540-45068-8_54openalex-snapshot
Host Revocation Authority: A Way of Protecting Mobile Agents from Malicious Hosts
inferredcites →https://doi.org/10.1007/3-540-48888-x_16openalex-snapshot
Mobile Agent Security — Issues and Directions
inferredcites →https://doi.org/10.1007/3-540-68671-1_1openalex-snapshot
Security Issues in Mobile Code Systems
inferredcites →https://doi.org/10.1007/3-540-68671-1_4openalex-snapshot
Protecting Mobile Agents Against Malicious Hosts
inferredcites →https://doi.org/10.1007/3-540-68671-1_6openalex-snapshot
Time Limited Blackbox Security: Protecting Mobile Agents From Malicious Hosts
inferredcites →https://doi.org/10.1007/978-3-540-27796-5_11openalex-snapshot
Improved Bounds for Optimal Black Hole Search with a Network Map
inferredcites →https://doi.org/10.1007/s00446-006-0154-yopenalex-snapshot
Searching for a black hole in arbitrary networks: optimal mobile agents protocols
inferredcites →https://doi.org/10.1007/s00453-006-1232-zopenalex-snapshot
Mobile Search for a Black Hole in an Anonymous Ring
inferredcites →https://doi.org/10.1016/s0004-3702(99)00107-1openalex-snapshot
On agent-based software engineering
inferredcites →https://doi.org/10.1016/s0140-3664(99)00083-3openalex-snapshot
Security issues related to mobile code and agent-based systems
inferredcites →https://doi.org/10.1090/s0002-9947-1932-1501641-2openalex-snapshot
Non-separable and planar graphs
inferredcites →https://doi.org/10.1109/icdcs.2000.840953openalex-snapshot
A framework to protect mobile agents by using reference states
inferredcites →https://doi.org/10.1137/0210062openalex-snapshot
An Efficient Cycle Vector Space Algorithm for Listing All Cycles of a Planar Graph
inferredcites →https://doi.org/10.1145/571825.571853openalex-snapshot
Searching for a black hole in arbitrary networks
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.1007/11947950_1openalex-snapshot
Distributed Security Algorithms by Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-3-642-05434-1_13openalex-snapshot
Locating a Black Hole without the Knowledge of Incoming Link
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.10.006openalex-snapshot
Black hole search in computer networks: State-of-the-art, challenges and future directions
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370460openalex-snapshot
Scattered Black Hole Search in an Oriented Ring using Tokens
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5161080openalex-snapshot
Map construction and exploration by mobile agents scattered in a dangerous network
inferred← citeshttps://doi.org/10.1142/s0129054108006327openalex-snapshot
USING SCATTERED MOBILE AGENTS TO LOCATE A BLACK HOLE IN AN UN-ORIENTED RING WITH TOKENS
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.20381/ruor-3182openalex-snapshot
Efficient Mechanisms for Exploration of Dangerous Graphs and for Inter-agent Communication
inferred← citeshttps://doi.org/10.20381/ruor-5411openalex-snapshot
Black Hole Search in the Network and Subway Models
inferred← citeshttps://doi.org/10.20381/ruor-5412openalex-snapshot
Network Decontamination with Temporal Immunity
inferred← citeshttps://doi.org/10.2200/s00278ed1v01y201004dct001openalex-snapshot
The Mobile Agent Rendezvous Problem in the Ring
inferred← citeshttps://doi.org/10.22215/etd/2007-06571openalex-snapshot
Using mobile agents for black hole search with tokens in multi networks
inferred← citeshttps://doi.org/10.48550/arxiv.0708.3734openalex-snapshot
Searching for a dangerous host: randomized vs. deterministic
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.