On the public citation graph

Searching for a Black Hole in Tree Networks

0 signed · 35 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/3-540-45414-4_12openalex-snapshot
Mobile Search for a Black Hole in an Anonymous Ring
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_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-27860-3_6openalex-snapshot
Multiple Agents RendezVous in a Ring in Spite of a Black Hole
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.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.ch5openalex-snapshot
Cooperating Mobile Agents
inferred← citeshttps://doi.org/10.1002/net.20233openalex-snapshot
Approximation bounds for Black Hole Search problems
inferred← citeshttps://doi.org/10.1007/11429647_17openalex-snapshot
Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs
inferred← citeshttps://doi.org/10.1007/11758471_16openalex-snapshot
Black Hole Search in Asynchronous Rings Using Tokens
inferred← citeshttps://doi.org/10.1007/11795490_21openalex-snapshot
Approximation Bounds for Black Hole Search Problems
inferred← citeshttps://doi.org/10.1007/11945529_23openalex-snapshot
Searching for Black-Hole Faults in a Network Using Multiple Agents
inferred← citeshttps://doi.org/10.1007/11947950_1openalex-snapshot
Distributed Security Algorithms by Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-0-387-34735-6_14openalex-snapshot
Exploring an Unknown Graph to Locate a Black Hole Using Tokens
inferred← citeshttps://doi.org/10.1007/978-3-030-11072-7_18openalex-snapshot
Dangerous Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-37110-4_3openalex-snapshot
Collusion Attack from Hubs in The Blockchain Offline Channel Network
inferred← citeshttps://doi.org/10.1007/978-3-032-16632-6_1openalex-snapshot
When Agents are Powerful: Black Hole Search in Time-Varying Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-59608-2_8openalex-snapshot
Faulty Node Repair and Dynamically Spawned Black Hole Search
inferred← citeshttps://doi.org/10.1007/978-3-540-69355-0_4openalex-snapshot
Locating and Repairing Faults in a Network with Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-3-642-10877-8_9openalex-snapshot
Synchronization Helps Robots to Detect Black Holes in Directed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-11476-2_15openalex-snapshot
Black Hole Search in Directed Graphs
inferred← citeshttps://doi.org/10.1007/978-981-97-7946-8_2openalex-snapshot
Exploration of a Grid with Blocked Nodes Using a Swarm of Autonomous Robots
inferred← citeshttps://doi.org/10.1007/s00224-005-1252-0openalex-snapshot
Efficient Exploration of Faulty Trees
inferred← citeshttps://doi.org/10.1007/s00224-007-9065-yopenalex-snapshot
Fault-Tolerant Sequential Scan
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.1016/j.tcs.2007.04.024openalex-snapshot
Hardness and approximation results for Black Hole Search in arbitrary networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.01.011openalex-snapshot
Locating and repairing faults in a network with mobile agents
inferred← citeshttps://doi.org/10.1109/icdcs.2006.25openalex-snapshot
Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search
inferred← citeshttps://doi.org/10.1145/3700838.3700869openalex-snapshot
Black Hole Search in Dynamic Graphs
inferred← citeshttps://doi.org/10.20381/ruor-18976openalex-snapshot
Best effort decontamination of networks
inferred← citeshttps://doi.org/10.20381/ruor-3770openalex-snapshot
Black Virus Disinfection in Chordal Rings
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.3233/fun-2006-712-305openalex-snapshot
Complexity of Searching for a Black Hole
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.