We introduce a new notion of resilience for constraint satisfaction problems, with the goal of more precisely determining the boundary between NP-hardness and the existence of efficient algorithms for resilient instances. In particular, we study r-resiliently k-colorable graphs, which are those k-colorable graphs that remain k-colorable even after the addition of any r new edges. We prove lower bounds on the NP-hardness of coloring resiliently colorable graphs, and provide an algorithm that colors sufficiently resilient graphs. We also analyze the corresponding notion of resilience for k-SAT. This notion of resilience suggests an array of open questions for graph coloring and other combinatorial problems. © 2014 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Kun, J., & Reyzin, L. (2014). On coloring resilient graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8635 LNCS, pp. 517–528). Springer Verlag. https://doi.org/10.1007/978-3-662-44465-8_44
Mendeley helps you to discover research relevant for your work.