Login / Signup
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications.
Michael R. Fellows
Danny Hermelin
Frances A. Rosamond
Published in:
Algorithmica (2012)
Keyphrases
</>
constraint satisfaction
bounded treewidth
np complete
constraint satisfaction problems
decision problems
boolean functions
highly parallelizable
relational learning
conjunctive queries
np hard
computational complexity
fixed parameter tractable
bounded degree
reinforcement learning
graph theoretic