Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width.
Daniel NeuenPublished in: CoRR (2023)
Keyphrases
- bounded tree width
- tree width
- markov networks
- np complete
- first order logic
- structural properties
- tree decomposition
- graphical models
- expressive power
- maximum likelihood
- constraint networks
- graph theory
- bayesian inference
- belief propagation
- exact and approximate
- markov random field
- shortest path
- decomposition method
- np hard
- bayesian networks
- document classification
- integrity constraints
- data complexity
- relational structures
- constraint satisfaction problems
- computationally challenging