The dominating set problem is fixed parameter tractable for graphs of bounded genus.
John A. EllisHongbing FanMichael R. FellowsPublished in: J. Algorithms (2004)
Keyphrases
- dominating set
- fixed parameter tractable
- connected dominating set
- bounded treewidth
- parameterized complexity
- np hard
- computational problems
- np complete
- facility location problem
- vertex set
- conjunctive queries
- abstract argumentation
- approximation algorithms
- global constraints
- boolean functions
- reinforcement learning
- decision problems
- weighted graph
- computational complexity
- integer programming
- constraint satisfaction problems
- linear programming
- optimal solution