Parameterised Enumeration for Modification Problems

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 sh...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithms Vol. 12; no. 9; p. 189
Main Authors:	Creignou, Nadia, Ktari, Raïda, Meier, Arne, Müller, Julian-Steffen, Olive, Frédéric, Vollmer, Heribert
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 01.09.2019 MDPI
Subjects:	Algorithms Artificial Intelligence bounded search tree Complexity theory Computational Complexity Computer Science Context Discrete Mathematics Enumeration Logic in Computer Science ordering parameterised complexity parameterised enumeration Parameterization Parameterised Enumeration Bounded Search Tree Parameterised complexity
ISSN:	1999-4893, 1999-4893
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!