Maximum Induced Forests in Graphs of Bounded Treewidth.

Glenn G. Chappell Michael J. Pelsmajer

Published in: Electron. J. Comb. (2013)

Keyphrases

bounded treewidth
np complete
decision problems
highly parallelizable
conjunctive queries
boolean functions
tractable cases
relational learning
fixed parameter tractable
information retrieval
bayesian networks
np hard
constraint satisfaction problems
graph theory
graph theoretic