On the public citation graph

Black hole search in common interconnection networks

https://doi.org/10.1002/net.20095

0 signed · 80 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.1002/net.20127openalex-snapshot

Collective Tree Exploration

inferredcites →https://doi.org/10.1006/jagm.1999.1043openalex-snapshot

Exploring Unknown Undirected Graphs

inferredcites →https://doi.org/10.1006/jnca.2000.0110openalex-snapshot

The data grid: Towards an architecture for the distributed management and analysis of large scientific datasets

inferredcites →https://doi.org/10.1007/3-540-40026-5_19openalex-snapshot

Locating Information with Uncertainty in Fully Interconnected Networks

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-61440-0_163openalex-snapshot

Agent rendezvous: A dynamic symmetry-breaking problem

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-0-387-35608-2_18openalex-snapshot

Memoryless Search Algorithms in a Network with Faulty Advice

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-39658-1_19openalex-snapshot

Deterministic Rendezvous in Graphs

inferredcites →https://doi.org/10.1007/b13632openalex-snapshot

Algorithms - ESA 2003

inferredcites →https://doi.org/10.1007/s00453-006-0074-2openalex-snapshot

Deterministic Rendezvous in Graphs

inferredcites →https://doi.org/10.1016/j.tcs.2008.04.034openalex-snapshot

Memoryless search algorithms in a network with faulty advice

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.1109/35.689634openalex-snapshot

Mobile agents and security

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/s009753979732428xopenalex-snapshot

Exploring Unknown Environments

inferredcites →https://doi.org/10.1145/571825.571853openalex-snapshot

Searching for a black hole in arbitrary networks

inferredcites →https://doi.org/10.5555/545381.545457openalex-snapshot

The freeze-tag problem: how to wake up a swarm of robots

inferredcites →https://doi.org/10.5555/545381.545459openalex-snapshot

Tree exploration with little memory

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.20233openalex-snapshot

Approximation bounds for Black Hole Search problems

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_16openalex-snapshot

Graph Explorations with 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-04298-5_3openalex-snapshot

Advice Complexity: Quantitative Approach to A-Priori Information

inferred← citeshttps://doi.org/10.1007/978-3-319-09620-9_27openalex-snapshot

Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host

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-540-69355-0_4openalex-snapshot

Locating and Repairing Faults in a Network with Mobile Agents

inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_5openalex-snapshot

Why Robots Need Maps

inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_46openalex-snapshot

Black Hole Search with Tokens in Interconnected Networks

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.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-3-642-17461-2_5openalex-snapshot

Time Optimal Algorithms for Black Hole Search in Rings

inferred← citeshttps://doi.org/10.1007/978-3-642-22212-2_17openalex-snapshot

Tight Bounds for Scattered Black Hole Search in a Ring

inferred← citeshttps://doi.org/10.1007/978-3-642-22212-2_18openalex-snapshot

Improving the Optimal Bounds for Black Hole Search in Rings

inferred← citeshttps://doi.org/10.1007/978-3-642-24100-0_41openalex-snapshot

Black Hole Search with Finite Automata Scattered in a Synchronous Torus

inferred← citeshttps://doi.org/10.1007/978-3-642-33536-5_30openalex-snapshot

Fault-Tolerant Exploration of an Unknown Dangerous Graph by Scattered Agents

inferred← citeshttps://doi.org/10.1007/978-3-642-39247-4_12openalex-snapshot

Exploring and Making Safe Dangerous Networks Using Mobile Entities

inferred← citeshttps://doi.org/10.1007/s00224-011-9341-8openalex-snapshot

Searching for Black Holes in Subways

inferred← citeshttps://doi.org/10.1007/s10878-018-0335-1openalex-snapshot

Minimum rank and zero forcing number for butterfly networks

inferred← citeshttps://doi.org/10.1016/j.jpdc.2013.08.009openalex-snapshot

Searching for a black hole in interconnected networks using mobile agents and tokens

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.1016/j.tcs.2011.05.054openalex-snapshot

Synchronous black hole search in directed graphs

inferred← citeshttps://doi.org/10.1016/j.tcs.2012.11.022openalex-snapshot

Exploring an unknown dangerous graph using tokens

inferred← citeshttps://doi.org/10.1016/j.tcs.2013.02.010openalex-snapshot

Tight bounds for black hole search with scattered agents in synchronous rings

inferred← citeshttps://doi.org/10.1016/j.tcs.2014.07.013openalex-snapshot

Exploring an unknown dangerous graph with a constant number of tokens

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.09.002openalex-snapshot

Explore and repair graphs with black holes using mobile entities

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.09.019openalex-snapshot

Improved periodic data retrieval in asynchronous rings with a faulty host

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/icdcs.2006.25openalex-snapshot

Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search

inferred← citeshttps://doi.org/10.1109/incos.2010.31openalex-snapshot

Exploration Algorithms by Multiple Robots in Challenged Communication Environment

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.1109/ipdpsw.2013.115openalex-snapshot

Network Decontamination from a Black Virus

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.1142/s0129054116500313openalex-snapshot

Exploration of Faulty Hamiltonian Graphs

inferred← citeshttps://doi.org/10.1142/s1793830911001346openalex-snapshot

TIME OPTIMAL ALGORITHMS FOR BLACK HOLE SEARCH IN RINGS

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.20381/ruor-3182openalex-snapshot

Efficient Mechanisms for Exploration of Dangerous Graphs and for Inter-agent Communication

inferred← citeshttps://doi.org/10.20381/ruor-3770openalex-snapshot

Black Virus Disinfection in Chordal Rings

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.22215/etd/2016-11362openalex-snapshot

Network Decontamination from Black Viruses

inferred← citeshttps://doi.org/10.3390/a16050222openalex-snapshot

Asynchronous Gathering in a Dangerous Ring

inferred← citeshttps://doi.org/10.48550/arxiv.0708.3734openalex-snapshot

Searching for a dangerous host: randomized vs. deterministic

inferred← citeshttps://doi.org/10.48550/arxiv.1410.4772openalex-snapshot

Mobile Agents Rendezvous in spite of a Malicious Agent

inferred← citeshttps://doi.org/10.70675/58e2747az6a79z40dezb604zbcda2fb26d19openalex-snapshot

Algorithms for deterministic parallel graph exploration

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.