arXiv (All)
open access
Don't Be Afraid to Die: Black Hole Search in Dynamic Graphs with Fewer Agents
We consider a team of synchronous mobile agents operating in a port-labeled network. There is one node in the network, called a black hole, that permanently destroys any agent that visits the node. The team of agents must safely locate the black hole, i.e., at least one agent must survive, terminate
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Don't Be Afraid to Die: Black Hole Search in Dynamic Graphs with Fewer Agents#668001
- Optimal Rates for Agentic Networked Information Aggregation#972252
- When Unlearning Fails: Reliable Data Deletion under Post-Training in Agent Networks#422216
- The wisdom-of-crowds: an efficient, philosophically-validated, social epistemological network profiling toolkit#726906
- ARIS: Autonomous Research via Adversarial Multi-Agent Collaboration#158780
Record · ID 974931
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive