Login / Signup
Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality.
Hans L. Bodlaender
Pinar Heggernes
Jan Arne Telle
Published in:
Electron. Notes Discret. Math. (2015)
Keyphrases
</>
bounded treewidth
np complete
decision problems
relational learning
highly parallelizable
boolean functions
conjunctive queries
inductive logic programming
propositional logic
fixed parameter tractable
optimal solution
np hard
information extraction
learning problems
graph theoretic
bounded degree