A (probably) optimal algorithm for Bisection on bounded-treewidth graphs.

Tesshu Hanaka Yasuaki Kobayashi Taiga Sone

Published in: Theor. Comput. Sci. (2021)

Keyphrases

dynamic programming
learning algorithm
optimal solution
database
computational complexity
bounded treewidth
databases
decision trees
objective function
np hard
domain knowledge
np complete
graph structure
vertex set