Fast Dynamic Programming on Graph Decompositions

06/05/2018
by   Johan M. M. van Rooij, et al.
0

In this paper, we consider tree decompositions, branch decompositions, and clique decompositions. We improve the running time of dynamic programming algorithms on these graph decompositions for a large number of problems as a function of the treewidth, branchwidth, or cliquewidth, respectively. On tree decompositions of width k, we improve the running time for Dominating Set to O(3^k). We generalise this result to [ρ,σ]-domination problems with finite or cofinite ρ and σ. For these problems, we give O(s^k)-time algorithms, where s is the number of `states' a vertex can have in a standard dynamic programming algorithm for such a problems. Furthermore, we give an O(2^k)-time algorithm for counting the number of perfect matchings in a graph, and generalise this to O(2^k)-time algorithms for many clique covering, packing, and partitioning problems. On branch decompositions of width k, we give an O(3^ω/2k)-time algorithm for Dominating Set, an O(2^ω/2k)-time algorithm for counting the number of perfect matchings, and O(s^ω/2k)-time algorithms for [ρ,σ]-domination problems involving s states with finite or cofinite ρ and σ. Finally, on clique decompositions of width k, we give O(4^k)-time algorithms for Dominating Set, Independent Dominating Set, and Total Dominating Set. The main techniques used in this paper are a generalisation of fast subset convolution, as introduced by Björklund et al., now applied in the setting of graph decompositions and augmented such that multiple states and multiple ranks can be used. Recently, Lokshtanov et al. have shown that some of the algorithms obtained in this paper have running times in which the base in the exponents is optimal, unless the Strong Exponential-Time Hypothesis fails.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/12/2017

Fast exact algorithms for some connectivity problems parametrized by clique-width

Given a clique-width expression of a graph G of clique-width k, we provi...
research
08/31/2022

A heuristic algorithm for the maximum happy vertices problem using tree decompositions

We propose a new heuristic algorithm for the Maximum Happy Vertices prob...
research
11/04/2017

Finding branch-decompositions of matroids, hypergraphs, and more

Given n subspaces of a finite-dimensional vector space over a fixed fini...
research
02/16/2022

A Polyhedral Study of Lifted Multicuts

Fundamental to many applications in data analysis are the decompositions...
research
07/03/2023

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

Dynamic programming on various graph decompositions is one of the most f...
research
09/28/2021

A Unifying Framework for Characterizing and Computing Width Measures

Algorithms for computing or approximating optimal decompositions for dec...
research
09/03/2021

Retraction: Improved Approximation Schemes for Dominating Set Problems in Unit Disk Graphs

Retraction note: After posting the manuscript on arXiv, we were informed...

Please sign up or login with your details

Forgot password? Click here to reset