Dynamic Programming on Tree Decompositions with D-FLAT.

Michael Abseher Bernhard Bliem Markus Hecher Marius Moldovan Stefan Woltran

Published in: Künstliche Intell. (2018)

Keyphrases

tree decompositions
dynamic programming
constraint satisfaction problems
tree decomposition
complexity bounds
linear programming
stereo matching
single machine
constraint satisfaction
databases
database systems
state space
scheduling problem
integrity constraints
constraint networks