Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width.
Daniel NeuenPublished in: STACS (2024)
Keyphrases
- bounded tree width
- tree width
- markov networks
- np complete
- first order logic
- structural properties
- tree decomposition
- expressive power
- graphical models
- maximum likelihood
- shortest path
- bayesian networks
- graph theory
- relational structures
- conjunctive queries
- data complexity
- computationally challenging
- objective function