K_6 minors in 6-connected graphs of bounded tree-width
Ken-ichi KawarabayashiSerguei NorineRobin ThomasPaul WollanPublished in: CoRR (2012)
Keyphrases
- bounded tree width
- connected graphs
- tree width
- markov networks
- np complete
- first order logic
- markov random field
- structural properties
- expressive power
- tree decomposition
- maximum likelihood
- graphical models
- belief propagation
- closed form
- probabilistic model
- conditional random fields
- constraint networks
- document classification
- posterior probability
- relational structures
- bayesian networks
- probabilistic reasoning
- maximum a posteriori
- shortest path
- higher order
- np hard
- bayesian inference
- parallel processing
- hidden variables
- conjunctive queries
- conditional probabilities
- data complexity
- relational databases
- similarity measure