arXiv (All)
open access
On the Parameterized Complexity of Coloring Discovery
Coloring Discovery asks whether a possibly improper initial coloring can be made proper within a prescribed number of allowed changes. We study the parameterized complexity of three modification step models that were studied previously in the literature: recoloring one vertex (color flipping), swapp
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
- Distributed Algorithms for Near-Equitable Coloring#429339
- Greedy-Like Defective Coloring: Distributed Algorithms and Applications#999838
- Flip Dynamics for Sampling Colorings: Improving $(11/6-ε)$ Using a Simple Metric#1062747
- An experimental study of forbidden patterns in geometric permutations by combinatorial lifting#311963
- Truly Work-efficient Parallel Deterministic $(Δ+1)$-coloring and Maximal Independent Set#441765
Record · ID 996655
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