Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.3390/a12090189 | ALGORITHMS |
Keywords | Field | DocType |
parameterised complexity,enumeration,bounded search tree,parameterised enumeration,ordering | Graph,Discrete mathematics,Combinatorics,Parameterized complexity,Computer science,Enumeration,Algebraic enumeration,Lexicographical order,Enumeration algorithm | Conference |
Volume | Issue | Citations |
12 | 9 | 3 |
PageRank | References | Authors |
0.40 | 13 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nadia Creignou | 1 | 573 | 43.79 |
| Raïda Ktari | 2 | 3 | 1.75 |
| Arne Meier | 3 | 126 | 19.00 |
| Julian-Steffen Müller | 4 | 37 | 4.00 |
| Frédéric Olive | 5 | 72 | 7.88 |
| Heribert Vollmer | 6 | 805 | 71.64 |