Login / Signup
: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy.
Bernhard Bliem
Günther Charwat
Markus Hecher
Stefan Woltran
Published in:
Fundam. Informaticae (2016)
Keyphrases
</>
tree decompositions
dynamic programming
constraint satisfaction problems
objective function
tree decomposition
complexity bounds
state space
single machine
linear programming
databases
query processing
stereo matching
graph theory