Graphs with bounded tree-width and large odd-girth are almost bipartite.
Alexandr V. KostochkaDaniel Král'Jean-Sébastien SereniMichael StiebitzPublished in: J. Comb. Theory, Ser. B (2010)
Keyphrases
- bounded tree width
- tree width
- markov networks
- np complete
- first order logic
- graph model
- structural properties
- tree decomposition
- bipartite graph
- expressive power
- constraint networks
- exact and approximate
- graphical models
- relational structures
- maximum likelihood
- belief propagation
- graph matching
- bayesian inference
- branch and bound
- posterior probability
- bayesian networks
- hidden variables
- conditional random fields