arXiv (All)
open access
The directional localization game on graphs
In the localization game on a graph $G$, a team of cops searches for an invisible, mobile robber on $G$ by "probing" vertices; each probe tells the cops the distance from the probed vertex to the robber. The cops win if they can uniquely determine the robber's location. In this paper, we introduce a
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
- Multi-axis Analysis of Image Manipulation Localization#204767
- Optimal Law Enforcement with Ordered Leniency#21024
- Twenty seconds to comply: Autonomous weapon systems and the recognition of surrender#769666
- Cops and Robber game in higher-dimensional manifolds with spherical and Euclidean metric#1038999
- An automatic drawing method for location tracking in wireless networks#499266
Record · ID 822174
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