Suchergebnisse - "parameterised complexity"
-
1
Parameterised complexity of model checking and satisfiability in propositional dependence logic
ISSN: 1012-2443, 1573-7470Veröffentlicht: Cham Springer International Publishing 01.03.2022Veröffentlicht in Annals of mathematics and artificial intelligence (01.03.2022)“… ) of PDL is NP -complete (Ebbing and Lohmann, SOFSEM 2012). The subject of this research is to identify a list of parameterisations …”
Volltext
Journal Article -
2
The challenges of unbounded treewidth in parameterised subgraph counting problems
ISSN: 0166-218X, 1872-6771Veröffentlicht: Elsevier B.V 10.01.2016Veröffentlicht in Discrete Applied Mathematics (10.01.2016)“… The paper also gives a thorough survey of known results on this subject and the methods used, as well as discussing the relationships both between multicolour and uncoloured versions of subgraph counting problems, and between exact counting, approximate counting and the corresponding decision problems …”
Volltext
Journal Article