Bounding Connected Tree-Width.

Matthias Hamann Daniel Weißauer

Published in: SIAM J. Discret. Math. (2016)

Keyphrases

tree width
tree decomposition
structural properties
upper bound
shortest path
constraint networks
conjunctive queries
exact and approximate
probabilistic reasoning
databases
parallel processing
data model
dynamic programming
branch and bound
computationally challenging