2 papers
cs.DS2026
Distance Recoloring
Niranka Banerjee, Christian Engels, Duc A. Hoang
Reconfiguration problems ask whether one feasible solution can be transformed into another by a sequence of local moves while maintaining feasibility throughout. For integers $d \g…
cs.DS2026
Directed Token Sliding
Niranka Banerjee, Christian Engels, Duc A. Hoang
Reconfiguration problems involve determining whether two given configurations can be transformed into each other under specific rules. The Token Sliding problem asks whether, given…