On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width.
M. RajaatiMohammad Reza HooshmandaslMichael J. DinneenAli ShakibaPublished in: CoRR (2016)
Keyphrases
- bounded tree width
- tree width
- markov networks
- np complete
- first order logic
- structural properties
- tree decomposition
- expressive power
- constraint networks
- fixed parameter tractable
- graphical models
- shortest path
- belief propagation
- graph theory
- markov random field
- relational structures
- conjunctive queries
- database
- constraint satisfaction
- np hard