Deciding Clique-Width for Graphs of Bounded Tree-Width.
Wolfgang EspelageFrank GurskiEgon WankePublished in: J. Graph Algorithms Appl. (2003)
Keyphrases
- bounded tree width
- tree width
- markov networks
- np complete
- first order logic
- expressive power
- tree decomposition
- structural properties
- graphical models
- maximum likelihood
- graph theory
- shortest path
- belief propagation
- conditional random fields
- bayesian networks
- conjunctive queries
- graph matching
- constraint satisfaction problems
- bayesian inference
- probabilistic model
- conditional probabilities
- posterior probability
- background knowledge
- document classification
- hidden variables
- generative model
- relational structures
- markov random field
- relational databases