{"paper":{"title":"The Complexity of Bounded Length Graph Recoloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Amer E. Mouawad, Paul Bonsma","submitted_at":"2014-04-01T18:38:49Z","abstract_excerpt":"We study the following question: Given are two $k$-colorings $\\alpha$ and $\\beta$ of a graph $G$ on $n$ vertices, and integer $\\ell$. The question is whether $\\alpha$ can be modified into $\\beta$, by recoloring vertices one at a time, while maintaining a $k$-coloring throughout, and using at most $\\ell$ such recoloring steps. This problem is weakly PSPACE-hard for every constant $k\\ge 4$. We show that it is also strongly NP-hard for every constant $k\\ge 4$. On the positive side, we give an $O(f(k,\\ell) n^{O(1)})$ algorithm for the problem, for some computable function $f$. Hence the problem is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0337","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}