Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms.

Julien Baste Ignasi Sau Dimitrios M. Thilikos

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

Keyphrases

bounded treewidth
highly parallelizable
graph theory
database
learning algorithm
data model
np complete
machine learning algorithms
databases
information retrieval
decision making
computational complexity
constraint satisfaction