Login / Signup
Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal.
Karl Bringmann
Jasper Slusallek
Published in:
CoRR (2021)
Keyphrases
</>
learning algorithm
highly parallelizable
data structure
bounded treewidth
databases
data mining
graph theory
information retrieval
machine learning algorithms