Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm.

Julien Baste Ignasi Sau Dimitrios M. Thilikos

Published in: SIAM J. Comput. (2023)

Keyphrases

dynamic programming
optimal solution
np hard
graph structure
bounded treewidth
computational complexity
search space
np complete
information retrieval
learning algorithm
database systems
lower bound
probability distribution