All articles published by MDPI are made immediately available worldwide under an open access license. No special
permission is required to reuse all or part of the article published by MDPI, including figures and tables. For
articles published under an open access Creative Common CC BY license, any part of the article may be reused without
permission provided that the original article is clearly cited. For more information, please refer to
https://www.mdpi.com/openaccess.
Feature papers represent the most advanced research with significant potential for high impact in the field. A Feature
Paper should be a substantial original Article that involves several techniques or approaches, provides an outlook for
future research directions and describes possible research applications.
Feature papers are submitted upon individual invitation or recommendation by the scientific editors and must receive
positive feedback from the reviewers.
Editor’s Choice articles are based on recommendations by the scientific editors of MDPI journals from around the world.
Editors select a small number of articles recently published in the journal that they believe will be particularly
interesting to readers, or important in the respective research area. The aim is to provide a snapshot of some of the
most exciting work published in the various research areas of the journal.
The study of reconfiguration problems has grown into a field of its own. The basic idea is to consider the scenario of moving from one given (feasible) solution to another, maintaining feasibility for all intermediate solutions. The solution space is often represented by a “reconfiguration graph”, where vertices represent solutions to the problem in hand and an edge between two vertices means that one can be obtained from the other in one step. A typical application background would be for a reorganization or repair work that has to be done without interruption to the service that is provided.
Back in February 2017, a workshop on Combinatorial Reconfiguration (see http://www.birs.ca/events/2017/5-day-workshops/17w5066) was organized at the Banff International Research Station for Mathematical Innovation and Discovery, or BIRS for short. This triggered quite a number of new research contacts, and so the idea was born to set up a Special Issue on Reconfiguration. An according Call was placed in particular towards the participants of the mentioned workshop.
The mentioned workshop was initiated by Naomi Nishimura, who also contributed a nice introduction and survey into this area for this Special Issue. Hence, we recommend to read [1] https://www.mdpi.com/1999-4893/11/4/52 as a start to the topic of this Special Issue.
2. Papers in this Special Issue
In response to the call for papers, we selected four submissions for this special issue. All submissions have been reviewed by at least two experts in reconfiguration problems. We survey below the published papers ordered by their publication dates.
In their first paper on the complexity of the Vertex Cover Reconfiguration problem (VCR) [2], Mouawad et al. show that VCR is W[1]-hard on bipartite graphs but fixed-parameter tractable on nowhere dense graphs. They also show the problem is solvable in polynomial time on trees as well as (under some assumptions) cactus graphs.
In the second paper by Haas and MacGillivray [3], the authors consider the reconfiguration graph of the Canonical k-Coloring problem. They show that such reconfiguration graph is connected for a particular given sequence and for large enough value of k. Moreover, the authors study the Hamoltonicity of this reconfiguration graph when the problem is restricted to complete multipartite graphs. In particular, while such reconfiguration graph is not Hamiltonian (in general), the authors show that it does contain a Hamiltonian path for with respect to a given ordering.
The third paper by Naomi Nishimura [1], mentioned above, provides an excellent survey of the topic via a thorough exposition of known structural results, such as those pertaining to the connectivity of a reconfiguration graph, as well as algorithmic methods.
In the fourth (and last) accepted paper on the complexity of Hamiltonian Cycle reconfiguration [4], Asahi Takaoka improves the state of the art by proving that the problem is PSPACE-complete for a number of special graph classes, such as chordal bipartite graphs, strongly chordal split graphs, and bipartite graphs with maximum degree 6. On the positive side, Takaoka shows constructively the existence of linear time algorithms that solve the problem on bipartite permutation graphs and on unit interval graphs.
Acknowledgments
The guest editors would like to thank all the authors for contributing their distinguished work to this special issue, the reviewers for their timely constructive comments, and the editorial staff of the MDPI Algorithms journal for their help and support.
Conflicts of Interest
The authors declare no conflict of interest.
References
Nishimura, N. Introduction to Reconfiguration. Algorithms2018, 11, 52. [Google Scholar] [CrossRef]
Mouawad, A.E.; Nishimura, N.; Raman, V.; Siebertz, S. Vertex Cover Reconfiguration and Beyond. Algorithms2018, 11, 20. [Google Scholar] [CrossRef]
Haas, R.; MacGillivray, G. Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs. Algorithms2018, 11, 40. [Google Scholar] [CrossRef]
Takaoka, A. Complexity of Hamiltonian Cycle Reconfiguration. Algorithms2018, 11, 140. [Google Scholar] [CrossRef]