127
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...