Parameterized algorithms for locating-dominating sets

by   MΓ‘rcia R. Cappelle, et al.

A locating-dominating set D of a graph G is a dominating set of G where each vertex not in D has a unique neighborhood in D, and the Locating-Dominating Set problem asks if G contains such a dominating set of bounded size. This problem is known to be 𝖭𝖯-𝗁𝖺𝗋𝖽 even on restricted graph classes, such as interval graphs, split graphs, and planar bipartite subcubic graphs. On the other hand, it is known to be solvable in polynomial time for some graph classes, such as trees and, more generally, graphs of bounded cliquewidth. While these results have numerous implications on the parameterized complexity of the problem, little is known in terms of kernelization under structural parameterizations. In this work, we begin filling this gap in the literature. Our first result shows that Locating-Dominating Set is 𝖢[1]-𝗁𝖺𝗋𝖽 when parameterized by the size of a minimum clique cover. We present an exponential kernel for the distance to cluster parameterization and show that, unless π–­π–―βŠ†π–Όπ—ˆπ–­π–―/π—‰π—ˆπ—…π—’, no polynomial kernel exists for Locating-Dominating Set when parameterized by vertex cover nor when parameterized by distance to clique. We then turn our attention to parameters not bounded by either of the previous two, and exhibit a linear kernel when parameterizing by the max leaf number; in this context, we leave the parameterization by feedback edge set as the primary open problem in our study.


page 1

page 2

page 3

page 4

βˆ™ 06/12/2019

Decremental Optimization of Dominating Sets Under Reachability Constraints

Given a dominating set, how much smaller a dominating set can we find th...
βˆ™ 10/16/2018

Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width

A semitotal dominating set of a graph G with no isolated vertex is a dom...
βˆ™ 07/07/2021

Budgeted Dominating Sets in Uncertain Graphs

We study the Budgeted Dominating Set (BDS) problem on uncertain graphs, ...
βˆ™ 05/09/2018

Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs

A hypergraph H is said to be 1-Sperner if for every two hyperedges the s...
βˆ™ 08/29/2018

The eternal dominating set problem for interval graphs

We prove that, in games in which all the guards move at the same turn, t...
βˆ™ 07/06/2021

Twin-width and polynomial kernels

We study the existence of polynomial kernels, for parameterized problems...
βˆ™ 02/13/2019

New Results on Directed Edge Dominating Set

We study a family of generalizations of Edge Dominating Set on directed ...

Please sign up or login with your details

Forgot password? Click here to reset