I/O-Efficient Algorithms for Graphs of Bounded Treewidth.

Anil Maheshwari Norbert Zeh

Published in: Algorithmica (2009)

Keyphrases

bounded treewidth
np complete
conjunctive queries
highly parallelizable
decision problems
boolean functions
database
fixed parameter tractable
monadic datalog
tractable cases
relational learning
logic programming
np hard
prior knowledge
computational complexity
knowledge base
machine learning
databases