On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width.
M. RajaatiMohammad Reza HooshmandaslMichael J. DinneenAli ShakibaPublished in: Discret. Math. Theor. Comput. Sci. (2018)
Keyphrases
- bounded tree width
- tree width
- markov networks
- np complete
- first order logic
- expressive power
- structural properties
- tree decomposition
- fixed parameter tractable
- constraint networks
- graphical models
- belief propagation
- relational structures
- shortest path
- maximum likelihood
- graph theory
- probabilistic model
- bayesian inference
- np hard
- hidden variables
- inductive logic programming
- conditional random fields
- conjunctive queries
- constraint satisfaction problems
- computational complexity