Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width.
Johann A. MakowskyPublished in: SODA (2001)
Keyphrases
- bounded tree width
- tree width
- markov networks
- np complete
- first order logic
- tree decomposition
- expressive power
- structural properties
- graphical models
- belief propagation
- maximum likelihood
- constraint networks
- bayesian networks
- relational structures
- np hard
- hidden variables
- shortest path
- probabilistic model
- bayesian inference
- graph theory
- graph matching
- posterior probability
- exact and approximate
- constraint satisfaction problems
- generative model