Bisection of bounded treewidth graphs by convolutions.

Eduard Eiben Daniel Lokshtanov Amer E. Mouawad

Published in: J. Comput. Syst. Sci. (2021)

Keyphrases

bounded treewidth
np complete
decision problems
highly parallelizable
conjunctive queries
boolean functions
relational learning
tractable cases
databases
knowledge base
lower bound
np hard
knowledge representation