Domination above r-independence: does sparseness help?

06/21/2019
by   Carl Einarson, et al.
0

Inspired by the potential of improving tractability via gap- or above-guarantee parametrisations, we investigate the complexity of Dominating Set when given a suitable lower-bound witness. Concretely, we consider being provided with a maximal r-independent set X (a set in which all vertices have pairwise distance at least r + 1) along the input graph G which, for r >= 2, lower-bounds the minimum size of any dominating set of G. In the spirit of gap-parameters, we consider a parametrisation by the size of the 'residual' set R := V (G) N [X]. Our work aims to answer two questions: How does the constant r affect the tractability of the problem and does the restriction to sparse graph classes help here? For the base case r = 2, we find that the problem is paraNP -complete even in apex- and bounded-degree graphs. For r = 3, the problem is W[2]-hard for general graphs but in FPT for nowhere dense classes and it admits a linear kernel for bounded expansion classes. For r >= 4, the parametrisation becomes essentially equivalent to the natural parameter, the size of the dominating set.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/15/2018

Kernelization and approximation of distance-r independent sets on nowhere dense graphs

For a positive integer r, a distance-r independent set in an undirected ...
research
11/19/2018

Experimental evaluation of kernelization algorithms to Dominating Set

The theoretical notions of graph classes with bounded expansion and that...
research
02/20/2020

A general kernelization technique for domination and independence problems in sparse classes

We unify and extend previous kernelization techniques in sparse classes ...
research
10/27/2017

On distance r-dominating and 2r-independent sets in sparse graphs

Dvorak (2013) gave a bound on the minimum size of a distance r dominatin...
research
10/07/2019

Distributed Distance-r Dominating Set on Sparse High-Girth Graphs

The dominating set problem and its generalization, the distance-r domina...
research
11/27/2019

Properties of nowhere dense graph classes related to independent set problem

A set is called r-independent, if every two vertices of it are in distan...
research
07/05/2023

Exact and Parameterized Algorithms for the Independent Cutset Problem

The Independent Cutset problem asks whether there is a set of vertices i...

Please sign up or login with your details

Forgot password? Click here to reset