Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs

by   Jacob Focke, et al.

We investigate how efficiently a well-studied family of domination-type problems can be solved on bounded-treewidth graphs. For sets σ,ρ of non-negative integers, a (σ,ρ)-set of a graph G is a set S of vertices such that |N(u)∩ S|∈σ for every u∈ S, and |N(v)∩ S|∈ρ for every v∉S. The problem of finding a (σ,ρ)-set (of a certain size) unifies standard problems such as Independent Set, Dominating Set, Independent Dominating Set, and many others. For all pairs of finite or cofinite sets (σ,ρ), we determine (under standard complexity assumptions) the best possible value c_σ,ρ such that there is an algorithm that counts (σ,ρ)-sets in time c_σ,ρ^ tw· n^O(1) (if a tree decomposition of width tw is given in the input). For example, for the Exact Independent Dominating Set problem (also known as Perfect Code) corresponding to σ={0} and ρ={1}, we improve the 3^ tw· n^O(1) algorithm of [van Rooij, 2020] to 2^ tw· n^O(1). Despite the unusually delicate definition of c_σ,ρ, we show that our algorithms are most likely optimal, i.e., for any pair (σ, ρ) of finite or cofinite sets where the problem is non-trivial, and any ε>0, a (c_σ,ρ-ε)^ tw· n^O(1)-algorithm counting the number of (σ,ρ)-sets would violate the Counting Strong Exponential-Time Hypothesis (#SETH). For finite sets σ and ρ, our lower bounds also extend to the decision version, showing that our algorithms are optimal in this setting as well. In contrast, for many cofinite sets, we show that further significant improvements for the decision and optimization versions are possible using the technique of representative sets.


page 1

page 2

page 3

page 4


Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results

For a well-studied family of domination-type problems, in bounded-treewi...

Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth

Many combinatorial problems can be solved in time O^*(c^tw) on graphs of...

Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth

For the General Factor problem we are given an undirected graph G and fo...

Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds

The goal of this work is to give precise bounds on the counting complexi...

Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)

In the general AntiFactor problem, a graph G is given with a set X_v⊆ℕ o...

Distributed Reconfiguration of Maximal Independent Sets

Consider the following problem: given a graph and two maximal independen...

Intensive use of computing resources for dominations in grids and other combinatorial problems

Our goal is to prove new results in graph theory and combinatorics thank...

Please sign up or login with your details

Forgot password? Click here to reset