Login / Signup
On the complexity of some colorful problems parameterized by treewidth.
Michael R. Fellows
Fedor V. Fomin
Daniel Lokshtanov
Frances A. Rosamond
Saket Saurabh
Stefan Szeider
Carsten Thomassen
Published in:
Inf. Comput. (2011)
Keyphrases
</>
decision problems
np hardness
np complete
computational issues
computer vision
information systems
reinforcement learning
special case
database
optimization problems
computational cost
tractable cases
problems involving
application domains
databases
data sets
real time