Login / Signup
The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth
Kitty Meeks
Alexander Scott
Published in:
CoRR (2011)
Keyphrases
</>
bounded treewidth
np complete
tractable cases
decision problems
highly parallelizable
parameterized complexity
computational complexity
fixed parameter tractable
decision making
natural language
dynamic programming
conjunctive queries