The parameterised complexity of list problems on graphs of bounded treewidth.

Kitty Meeks Alexander Scott

Published in: Inf. Comput. (2016)

Keyphrases

bounded treewidth
np complete
tractable cases
decision problems
highly parallelizable
conjunctive queries
fixed parameter tractable
databases
computational complexity
machine learning
bayesian networks
utility function
boolean functions
graph theoretic
computational problems