Between Treewidth and Clique-Width.

Sigve Hortemo Sæther Jan Arne Telle

Published in: WG (2014)

Keyphrases

upper bound
search space
space complexity
bounded treewidth
boolean functions
tree decompositions
discrete random variables
artificial intelligence
lower bound
data mining
information systems
objective function
np complete
maximum weight