H-Free Coloring on Graphs with Bounded Tree-Width.
N. R. AravindSubrahmanyam KalyanasundaramAnjeneya Swami KarePublished in: CALDAM (2019)
Keyphrases
- bounded tree width
- tree width
- np complete
- markov networks
- first order logic
- structural properties
- tree decomposition
- maximum likelihood
- expressive power
- graphical models
- constraint networks
- shortest path
- conjunctive queries
- belief propagation
- computationally challenging
- graph theory
- special case
- constraint satisfaction problems
- generative model
- query language