Between Treewidth and Clique-Width.

Sigve Hortemo Sæther Jan Arne Telle

Published in: Algorithmica (2016)

Keyphrases

upper bound
search space
bounded treewidth
space complexity
boolean functions
independent set
tree decompositions
maximum weight
machine learning
graph structure
fixed width
discrete random variables
genetic algorithm
query processing
np complete
constraint graph