The Fine Details of Fast Dynamic Programming over Tree Decompositions.

Hans L. Bodlaender Paul S. Bonsma Daniel Lokshtanov

Published in: IPEC (2013)

Keyphrases

fine details
tree decompositions
dynamic programming
constraint satisfaction problems
edge information
tree decomposition
bilateral filtering
complexity bounds
state space
constraint networks
speckle noise
probabilistic model
spatial information
hypertree decomposition