Paths between colourings of graphs with bounded tree-width.
Carl FeghaliPublished in: Inf. Process. Lett. (2019)
Keyphrases
- bounded tree width
- tree width
- markov networks
- np complete
- shortest path
- first order logic
- tree decomposition
- structural properties
- expressive power
- constraint networks
- maximum likelihood
- graphical models
- bayesian networks
- probabilistic model
- computationally challenging
- belief propagation
- conjunctive queries
- exact and approximate
- np hard
- conditional random fields
- higher order
- bayesian inference
- upper bound
- relational structures
- objective function