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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithms Ročník 12; číslo 9; s. 189
Hlavní autori:	Creignou, Nadia, Ktari, Raïda, Meier, Arne, Müller, Julian-Steffen, Olive, Frédéric, Vollmer, Heribert
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Basel MDPI AG 01.09.2019 MDPI
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!