Login / Signup
Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth.
Julien Baste
Ignasi Sau
Dimitrios M. Thilikos
Published in:
IPEC (2017)
Keyphrases
</>
bounded treewidth
highly parallelizable
graph theory
knowledge base
search space
np complete
machine learning algorithms
conjunctive queries
graph theoretic