Deciding Clique-Width for Graphs of Bounded Tree-Width.
Wolfgang EspelageFrank GurskiEgon WankePublished in: WADS (2001)
Keyphrases
- bounded tree width
- tree width
- markov networks
- first order logic
- np complete
- structural properties
- tree decomposition
- maximum likelihood
- graphical models
- expressive power
- relational structures
- constraint networks
- bayesian inference
- shortest path
- conjunctive queries
- belief propagation
- bayesian networks
- posterior probability
- branch and bound
- document classification
- conditional random fields
- exact and approximate
- inductive logic programming
- probabilistic reasoning
- hidden variables
- graph theory
- probabilistic model
- query language