Next Article in Journal
Parallelism Strategies for Big Data Delayed Transfer Entropy Evaluation
Next Article in Special Issue
A Machine Learning Approach to Algorithm Selection for Exact Computation of Treewidth
Previous Article in Journal / Special Issue
A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy

Parameterised Enumeration for Modification Problems

Aix-Marseille Université, CNRS, LIS, 13003 Marseille, France
Pôle technologique de Sfax, Université de Sfax, Sfax 3000, Tunisia
Institut für Theoretische Informatik, Leibniz Universität Hannover, 30167 Hannover, Germany
Author to whom correspondence should be addressed.
This paper is an extended version of our paper published in Parameterized Enumeration for Modification Problems. In Proceedings of the Language and Automata Theory and Applications—9th International Conference, Nice, France, 2–6 March 2015.
Algorithms 2019, 12(9), 189;
Received: 14 July 2019 / Revised: 29 August 2019 / Accepted: 5 September 2019 / Published: 9 September 2019
(This article belongs to the Special Issue New Frontiers in Parameterized Complexity and Algorithms)
Recently, Creignou et al. (Theory Comput. Syst. 2017), introduced the class DelayFPT into parameterised complexity theory in order to capture the notion of efficiently solvable parameterised enumeration problems. In this paper, we propose a framework for parameterised ordered enumeration and will show how to obtain enumeration algorithms running with an FPT delay in the context of general modification problems. We study these problems considering two different orders of solutions, namely, lexicographic order and order by size. Furthermore, we present two generic algorithmic strategies. The first one is based on the well-known principle of self-reducibility and is used in the context of lexicographic order. The second one shows that the existence of a neighbourhood structure among the solutions implies the existence of an algorithm running with FPT delay which outputs all solutions ordered non-decreasingly by their size. View Full-Text
Keywords: parameterised complexity; enumeration; bounded search tree; parameterised enumeration; ordering parameterised complexity; enumeration; bounded search tree; parameterised enumeration; ordering
Show Figures

Figure 1

MDPI and ACS Style

Creignou, N.; Ktari, R.; Meier, A.; Müller, J.-S.; Olive, F.; Vollmer, H. Parameterised Enumeration for Modification Problems. Algorithms 2019, 12, 189.

AMA Style

Creignou N, Ktari R, Meier A, Müller J-S, Olive F, Vollmer H. Parameterised Enumeration for Modification Problems. Algorithms. 2019; 12(9):189.

Chicago/Turabian Style

Creignou, Nadia; Ktari, Raïda; Meier, Arne; Müller, Julian-Steffen; Olive, Frédéric; Vollmer, Heribert. 2019. "Parameterised Enumeration for Modification Problems" Algorithms 12, no. 9: 189.

Find Other Styles
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

Search more from Scilit
Back to TopTop