Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs.

Michael R. Fellows Danny Hermelin Frances A. Rosamond

Published in: IWPEC (2009)

Keyphrases

bounded treewidth
np complete
decision problems
highly parallelizable
conjunctive queries
boolean functions
relational learning
fixed parameter tractable
data mining
learning algorithm
xml documents
np hard
bounded degree
monadic datalog