An optimal algorithm for Bisection for bounded-treewidth graphs.

Tesshu Hanaka Yasuaki Kobayashi Taiga Sone

Published in: CoRR (2020)

Keyphrases

dynamic programming
optimal solution
np hard
learning algorithm
search space
special case
graph structure
spanning tree
bounded treewidth
data mining
decision making
objective function
computational complexity
relational databases
data model