arXiv (OAI Expanded)
open access
Color Complexity of Recolorable Graph Exploration: Upper and Lower Bounds via Block Structure
We study exploration of anonymous, port-free graphs by a single agent with no internal memory. To compensate for the lack of memory, the agent uses writable vertex colors as external memory. From every starting vertex, the agent must visit all vertices, return to its start, and terminate there. Thro
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
- Color Complexity of Recolorable Graph Exploration: Upper and Lower Bounds via Block Structure#919361
- Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors#1131392
- A universal dichotomy for concentration in randomly colored graphs#924557
- A universal dichotomy for concentration in randomly colored graphs#920325
- OpenZL: Using Graphs to Compress Smaller and Faster#175359
Record · ID 1083801
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