arXiv (All)
open access
Three-Color Free-Flood-It on Fixed-Height Grids Is Polynomial-Time Solvable
We give a deterministic algorithm for \textsc{Free-Flood-It} on rectangular grids $P_k\square P_n$ with at most three colors. For every fixed height $k$, it computes the minimum number of moves and an optimal sequence in $N^{O(k^2)}$ time, where $N=kn$. This resolves the previously open three-color
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
- A Brooks-like result for graph powers $#983875
- Faster Minimum k-Cut II: Near-Optimal and Deterministic for Weighted Graphs#1064341
- Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)#144174
- Linear-Time FPT Algorithm for Surface Disjoint Paths via Surface Cutting#1077253
- Sequence b-colorings in graphs#985835
Record · ID 1132319
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