Introduction to Reconfiguration
AbstractReconfiguration is concerned with relationships among solutions to a problem instance, where the reconfiguration of one solution to another is a sequence of steps such that each step produces an intermediate feasible solution. The solution space can be represented as a reconfiguration graph, where two vertices representing solutions are adjacent if one can be formed from the other in a single step. Work in the area encompasses both structural questions (Is the reconfiguration graph connected?) and algorithmic ones (How can one find the shortest sequence of steps between two solutions?) This survey discusses techniques, results, and future directions in the area. View Full-Text
Share & Cite This Article
Nishimura, N. Introduction to Reconfiguration. Algorithms 2018, 11, 52.
Nishimura N. Introduction to Reconfiguration. Algorithms. 2018; 11(4):52.Chicago/Turabian Style
Nishimura, Naomi. 2018. "Introduction to Reconfiguration." Algorithms 11, no. 4: 52.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.