Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal.

Karl Bringmann Jasper Slusallek

Published in: ICALP (2021)

Keyphrases

data structure
np complete
bounded treewidth
learning algorithm
decision trees
computational complexity
query processing
query language
decision problems