Enumerating Connected Dominating Sets

04/29/2022
āˆ™
by   Faisal Abu-Khzam, et al.
āˆ™
0
āˆ™

The question to enumerate all inclusion-minimal connected dominating sets in a graph of order n in time significantly less than 2^n is an open question that was asked in many places. We answer this question affirmatively, by providing an enumeration algorithm that runs in time š’Ŗ(1.9896^n), using polynomial space only. The key to this result is the consideration of this enumeration problem on 2-degenerate graphs, which is proven to be possible in time š’Ŗ(1.9767^n). We also show new lower bound results by constructing a family of graphs of order n with Ī©(1.4890^n) minimal connected dominating sets, while previous examples achieved Ī©(1.4422^n). Our construction results in lower bounds for a few special graph classes. We also address essential questions concerning output-sensitive enumeration. Namely, we give reasons why our algorithm cannot be turned into an enumeration algorithm that guarantees polynomial delay without much efforts. More precisely, we prove that it is NP-complete to decide, given a graph G and a vertex set U, if there exists a minimal connected dominating set D with UāŠ† D, even if G is known to be 2-degenerate. Our reduction also shows that even any subexponential delay is not easy to achieve for enumerating minimal connected dominating sets. Another reduction shows that no FPT-algorithms can be expected for this extension problem concerning minimal connected dominating sets, parameterized by |U|. We also relate our enumeration problem to the famous open Hitting Set Transversal problem, which can be phrased in our context as the question to enumerate all minimal dominating sets of a graph with polynomial delay by showing that a polynomial-delay enumeration algorithm for minimal connected dominating sets implies an affirmative algorithmic solution to the Hitting Set Transversal problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
āˆ™ 11/11/2021

A Note on the Maximum Number of Minimal Connected Dominating Sets in a Graph

We prove constructively that the maximum possible number of minimal conn...
research
āˆ™ 10/01/2018

Enumerating minimal dominating sets in triangle-free graphs

It is a long-standing open problem whether the minimal dominating sets o...
research
āˆ™ 05/11/2023

Minimal dominating sets enumeration with FPT-delay parameterized by the degeneracy and maximum degree

At STOC 2002, Eiter, Gottlob, and Makino presented a technique called or...
research
āˆ™ 08/10/2022

Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes

The concept of Roman domination has recently been studied concerning enu...
research
āˆ™ 04/10/2022

Minimal Roman Dominating Functions: Extensions and Enumeration

Roman domination is one of the many variants of domination that keeps mo...
research
āˆ™ 08/31/2023

Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints

In this paper, we consider the problems of enumerating minimal vertex co...
research
āˆ™ 09/13/2023

Perfect Roman Domination and Unique Response Roman Domination

The idea of enumeration algorithms with polynomial delay is to polynomia...

Please sign up or login with your details

Forgot password? Click here to reset