DeepAI AI Chat
Log In Sign Up

New Results on Directed Edge Dominating Set

by   Rémy Belmonte, et al.

We study a family of generalizations of Edge Dominating Set on directed graphs called Directed (p,q)-Edge Dominating Set. In this problem an arc (u,v) is said to dominate itself, as well as all arcs which are at distance at most q from v, or at distance at most p to u. First, we give significantly improved FPT algorithms for the two most important cases of the problem, (0,1)-dEDS and (1,1)-dEDS (that correspond to versions of Dominating Set on line graphs), as well as polynomial kernels. We also improve the best-known approximation for these cases from logarithmic to constant. In addition, we show that (p,q)-dEDS is FPT parameterized by p+q+tw, but W-hard parameterized by tw (even if the size of the optimal is added as a second parameter), where tw is the treewidth of the underlying graph of the input. We then go on to focus on the complexity of the problem on tournaments. Here, we provide a complete classification for every possible fixed value of p,q, which shows that the problem exhibits a surprising behavior, including cases which are in P; cases which are solvable in quasi-polynomial time but not in P; and a single case (p=q=1) which is NP-hard (under randomized reductions) and cannot be solved in sub-exponential time, under standard assumptions.


page 1

page 2

page 3

page 4


On the complexity of Dominating Set for graphs with fixed diameter

A set S⊆ V of a graph G=(V,E) is a dominating set if each vertex has a n...

Counting Dominating Sets in Directed Path Graphs

A dominating set of a graph is a set of vertices such that every vertex ...

Budgeted Dominating Sets in Uncertain Graphs

We study the Budgeted Dominating Set (BDS) problem on uncertain graphs, ...

Parameterized algorithms for locating-dominating sets

A locating-dominating set D of a graph G is a dominating set of G where ...

On Kernelization for Edge Dominating Set under Structural Parameters

In the NP-hard Edge Dominating Set problem (EDS) we are given a graph G=...

Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames

We consider the Minimum Dominating Set (MDS) problem on the intersection...

Approximating Dominating Set on Intersection Graphs of L-frames

We consider the Dominating Set (DS) problem on the intersection graphs o...