Dominating set is fixed parameter tractable in claw-free graphs.
Marek CyganGeevarghese PhilipMarcin PilipczukMichal PilipczukJakub Onufry WojtaszczykPublished in: Theor. Comput. Sci. (2011)
Keyphrases
- dominating set
- connected dominating set
- fixed parameter tractable
- facility location problem
- parameterized complexity
- bounded treewidth
- np hard
- computational problems
- np complete
- directed graph
- global constraints
- abstract argumentation
- facility location
- vertex set
- graph theoretic
- approximation algorithms
- conjunctive queries
- special case