DeepAI AI Chat
Log In Sign Up

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

by   Jacob Focke, et al.

For a well-studied family of domination-type problems, in bounded-treewidth graphs, we investigate whether it is possible to find faster algorithms. 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 common problems like Independent Set, Dominating Set, Independent Dominating Set, and many others. In an accompanying paper, it is proven that, for all pairs of finite or cofinite sets (σ,ρ), 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). Here, c_σ,ρ is a constant with an intricate dependency on σ and ρ. Despite this intricacy, we show that the algorithms in the accompanying paper 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 those algorithms are optimal in this setting as well.


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

We investigate how efficiently a well-studied family of domination-type ...

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...

Count on CFI graphs for #P-hardness

Given graphs H and G, possibly with vertex-colors, a homomorphism is a f...

Distributed Reconfiguration of Maximal Independent Sets

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

Finding and Counting Patterns in Sparse Graphs

We consider algorithms for finding and counting small, fixed graphs in s...

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...