Next Article in Journal
Linking and Cutting Spanning Trees
Next Article in Special Issue
Complexity of Hamiltonian Cycle Reconfiguration
Previous Article in Journal
A Crowd Cooperative Spectrum Sensing Algorithm Using a Non-Ideal Channel
Previous Article in Special Issue
Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs
Open AccessArticle

Introduction to Reconfiguration

David R. Cheriton School of Computer Science, University of Waterloo, 200 University Avenue West, Waterloo, ON N2L 3G1, Canada
Algorithms 2018, 11(4), 52; https://doi.org/10.3390/a11040052
Received: 13 September 2017 / Revised: 17 April 2018 / Accepted: 17 April 2018 / Published: 19 April 2018
(This article belongs to the Special Issue Reconfiguration Problems)
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. View Full-Text
Keywords: reconfiguration problems; algorithms; complexity reconfiguration problems; algorithms; complexity
Show Figures

Figure 1

MDPI and ACS Style

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

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop