Bisection of Bounded Treewidth Graphs by Convolutions.

Eduard Eiben Daniel Lokshtanov Amer E. Mouawad

Published in: ESA (2019)

Keyphrases

bounded treewidth
np complete
decision problems
boolean functions
conjunctive queries
relational learning
tractable cases
highly parallelizable
databases
graph theoretic
np hard
domain knowledge
graph theory
fixed parameter tractable