arXiv (All)
open access
Beyond the Boundary: Optimal Grid Dispersion by Spread, Reverse, and Collect
\emph{Dispersion} requires a set of mobile agents to occupy distinct nodes of a graph such that each node contains at most one agent. We study deterministic dispersion of $k\le n$ agents on an $n$-node oriented square grid, where each node has globally consistent North, East, South, and West port la
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
- Beyond the Boundary: Optimal Grid Dispersion by Spread, Reverse, and Collect#1318977
- The 11/6 supremum of the Wang-Sitters rounding scheme for graph balancing#998384
- Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case#1084316
- The design and optimization of cooperative mobile edge#641322
- Generating cyclic pivot Gray codes for well-ordered $k$-degenerate graphs in constant amortized time#1233449
Record · ID 1341817
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