Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Introduction to Reconfiguration

Version 1 : Received: 13 September 2017 / Approved: 14 September 2017 / Online: 14 September 2017 (09:43:15 CEST)

A peer-reviewed article of this Preprint also exists.

Nishimura, N. Introduction to Reconfiguration. Algorithms 2018, 11, 52. Nishimura, N. Introduction to Reconfiguration. Algorithms 2018, 11, 52.

Journal reference: Algorithms 2018, 11, 52
DOI: 10.3390/a11040052


Reconfiguration 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.


reconfiguration problems; algorithms; complexity


MATHEMATICS & COMPUTER SCIENCE, General & Theoretical Computer Science

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0

Notify me about updates to this article or when a peer-reviewed version is published.

We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.