Equivalent Definitions of Recognizability for Sets of Graphs of Bounded Tree-Width.

Bruno Courcelle Jens Lagergren

Published in: Math. Struct. Comput. Sci. (1996)

Keyphrases

bounded tree width
tree width
np complete
first order logic
markov networks
tree decomposition
structural properties
expressive power
exact and approximate
belief propagation
image segmentation
shortest path
constraint networks
probabilistic reasoning
relational structures
graph cuts
higher order
query processing