Domination Problems in Nowhere-Dense Classes of Graphs

Details Domination Problems in Nowhere-Dense Classes of Graphs Domination Problems in Nowhere-Dense Classes of Graphs

2009-07-24

arxiv.org/abs/0907.4283v1

Computer Science

Data Structures and Algorithms

Scientific paper

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 the distance-d dominating-set problem, also known as the (k,d)-centres problem, is fixed-parameter tractable on any class that is nowhere dense and closed under induced subgraphs. This generalises known results about the dominating set problem on H-minor free classes, classes with locally excluded minors and classes of graphs of bounded expansion. A key feature of our proof is that it is based simply on the fact that these graph classes are uniformly quasi-wide, and does not rely on a structural decomposition. Our result also establishes that the distance-d dominating-set problem is FPT on classes of bounded expansion, answering a question of Ne{\v s}et{\v{r}}il and Ossona de Mendez.

Affiliated with

Also associated with

No associations

Rating

Domination Problems in Nowhere-Dense Classes of Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Domination Problems in Nowhere-Dense Classes of Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Domination Problems in Nowhere-Dense Classes of Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-310268