5 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.DS2018★ 5 cited
Complexity of Reconfiguration Problems for Constraint Satisfaction
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
Constraint satisfaction problem (CSP) is a well-studied combinatorial search problem, in which we are asked to find an assignment of values to given variables so as to satisfy all…
cs.DM2016
The Complexity of (List) Edge-Coloring Reconfiguration Problem
Hiroki Osawa, Akira Suzuki, Takehiro Ito +1
Let be a graph such that each edge has its list of available colors, and assume that each list is a subset of the common set consisting of colors. Suppose that we are given…