7 research outputs found
Solving Connectivity Problems Parameterized by Treedepth in Single-Exponential Time and Polynomial Space
A breakthrough result of Cygan et al. (FOCS 2011) showed that connectivity problems parameterized by treewidth can be solved much faster than the previously best known time ?^*(2^{?(twlog tw)}). Using their inspired Cut&Count technique, they obtained ?^*(?^tw) time algorithms for many such problems. Moreover, they proved these running times to be optimal assuming the Strong Exponential-Time Hypothesis. Unfortunately, like other dynamic programming algorithms on tree decompositions, these algorithms also require exponential space, and this is widely believed to be unavoidable. In contrast, for the slightly larger parameter called treedepth, there are already several examples of matching the time bounds obtained for treewidth, but using only polynomial space. Nevertheless, this has remained open for connectivity problems.
In the present work, we close this knowledge gap by applying the Cut&Count technique to graphs of small treedepth. While the general idea is unchanged, we have to design novel procedures for counting consistently cut solution candidates using only polynomial space. Concretely, we obtain time ?^*(3^d) and polynomial space for Connected Vertex Cover, Feedback Vertex Set, and Steiner Tree on graphs of treedepth d. Similarly, we obtain time ?^*(4^d) and polynomial space for Connected Dominating Set and Connected Odd Cycle Transversal
Domination and Cut Problems on Chordal Graphs with Bounded Leafage
The leafage of a chordal graph is the minimum integer such that can be realized as an intersection graph of subtrees of a tree with leaves.
We consider structural parameterization by the leafage of classical domination and cut problems on chordal graphs.
Fomin, Golovach, and Raymond~[ESA~, Algorithmica~] proved, among other things, that \textsc{Dominating Set} on chordal graphs admits an algorithm running in time .
We present a conceptually much simpler algorithm that runs in time .
We extend our approach to obtain similar results for \textsc{Connected Dominating Set} and \textsc{Steiner Tree}.
We then consider the two classical cut problems \textsc{MultiCut with Undeletable Terminals} and \textsc{Multiway Cut with Undeletable Terminals}.
We prove that the former is \textsf{W}[1]-hard when parameterized by the leafage and complement this result by presenting a simple -time algorithm.
To our surprise, we find that \textsc{Multiway Cut with Undeletable Terminals} on chordal graphs can be solved, in contrast, in -time
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs
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 is a set of
vertices such that for every , and for every . 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 such
that there is an algorithm that counts -sets in time
(if a tree decomposition of width
is given in the input). For example, for the Exact Independent
Dominating Set problem (also known as Perfect Code) corresponding to
and , we improve the
algorithm of [van Rooij, 2020] to .
Despite the unusually delicate definition of , 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
, a -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
LIPIcs, Volume 274, ESA 2023, Complete Volume
LIPIcs, Volume 274, ESA 2023, Complete Volum