Next Article in Journal
Differential-Evolution-Based Coevolution Ant Colony Optimization Algorithm for Bayesian Network Structure Learning
Previous Article in Journal
Pricing Strategies of Logistics Distribution Services for Perishable Commodities
Previous Article in Special Issue
Complexity of Hamiltonian Cycle Reconfiguration
Article Menu

Export Article

Open AccessEditorial
Algorithms 2018, 11(11), 187;

Special Issue on Reconfiguration Problems

Department of Computer Science and Mathematics, Lebanese American University, Beirut 11022801, Lebanon
Informatikwissenschaften, CIRT, FB IV, Universität Trier, Universitätsring 15, 54296 Trier, Germany
School of Information Science, Japan Advanced Institute of Science and Technology, Asahidai 1-1, Nomi, Ishikawa 923-1292, Japan
Authors to whom correspondence should be addressed.
Received: 12 November 2018 / Accepted: 12 November 2018 / Published: 19 November 2018
(This article belongs to the Special Issue Reconfiguration Problems)
PDF [157 KB, uploaded 19 November 2018]


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. View Full-Text
Keywords: reconfiguration problem; computational complexity reconfiguration problem; computational complexity
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Abu-Khzam, F.; Fernau, H.; Uehara, R. Special Issue on Reconfiguration Problems. Algorithms 2018, 11, 187.

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.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top