Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes.

Volker Heun Ernst W. Mayr

Published in: J. Algorithms (2002)

Keyphrases

bounded treewidth
np complete
conjunctive queries
decision problems
highly parallelizable
database
graph embedding
graph theoretic
boolean functions
query language
optimal solution
query answering
semi supervised learning
relational learning
dynamic programming
domain knowledge
search space