minors in 6-connected graphs of bounded tree-width.
Ken-ichi KawarabayashiSerguei NorineRobin ThomasPaul WollanPublished in: J. Comb. Theory, Ser. B (2019)
Keyphrases
- bounded tree width
- connected graphs
- markov networks
- tree width
- np complete
- markov random field
- first order logic
- structural properties
- belief propagation
- graphical models
- tree decomposition
- maximum likelihood
- expressive power
- closed form
- conditional random fields
- probabilistic model
- bayesian inference
- computational complexity
- graph cuts
- constraint networks
- hidden variables
- document classification
- posterior probability
- conditional probabilities
- branch and bound
- image segmentation
- graph theory
- conjunctive queries
- knowledge representation
- exact and approximate
- text classification
- constraint satisfaction problems
- np hard
- generative model