Introduction to Reconfiguration

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

Full description

Saved in:
Bibliographic Details
Published inAlgorithms Vol. 11; no. 4; p. 52
Main Author Nishimura, Naomi
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 19.04.2018
Subjects
algorithms
complexity
Graph theory
Graphical representations
Reconfiguration
reconfiguration problems
Solution space
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1999-4893
1999-4893
DOI:10.3390/a11040052