Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:
Problems: Constraint satisfaction
Choose Problem

Authors: all
Choose Author


[25]
Paul S. Bonsma, Amer E. Mouawad, Naomi Nishimura and Venkatesh Raman,
The complexity of bounded length graph recoloring and CSP reconfiguration,
Proceedings of the 9th International Symposium on Parameterized and Exact Computation (IPEC 2014), Lecture Notes in Computer Science 8894, pp. 110-121, 2014. (LINK)