Nonrepetitive colorings of graphs of bounded tree-width.
André KündgenMichael J. PelsmajerPublished in: Discret. Math. (2008)
Keyphrases
- bounded tree width
- tree width
- markov networks
- np complete
- first order logic
- structural properties
- tree decomposition
- belief propagation
- expressive power
- graphical models
- probabilistic model
- conjunctive queries
- constraint networks
- constraint satisfaction problems
- np hard
- constraint satisfaction
- maximum likelihood
- graph matching
- graph theory
- exact and approximate
- bayesian networks
- shortest path
- markov random field
- knowledge base
- conditional random fields
- random variables