Improved tree decomposition based algorithms for domination-like problems
From MaRDI portal
Recommendations
- Practical algorithms on partial k-trees with an application to domination-like problems
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Faster algorithms on branch and clique decompositions
- Dynamic programming and planarity: improved tree-decomposition based algorithms
- The Fine Details of Fast Dynamic Programming over Tree Decompositions
Cited in
(33)- The parameterized complexity of the induced matching problem
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
- Star partitions on graphs
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center
- On independent sets and bicliques in graphs
- Tree decompositions of graphs: saving memory in dynamic programming
- Counting Maximal Independent Sets in Subcubic Graphs
- Graph minors and parameterized algorithm design
- Dual parameterization and parameterized approximability of subset graph problems
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
- Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
- Courcelle's theorem -- a game-theoretic approach
- Weighted maximum-clique transversal sets of graphs
- Branch decompositions and minor containment
- Optimal dynamic program for r-domination problems over tree decompositions
- Graphs, branchwidth, and tangles! Oh my!
- Fast Algorithms for Join Operations on Tree Decompositions
- Practical algorithms on partial k-trees with an application to domination-like problems
- On the \(k\)-rainbow domination in graphs with bounded tree-width
- scientific article; zbMATH DE number 7278055 (Why is no real title available?)
- Tree-decompositions of small pathwidth
- Algorithms for minimum membership dominating set problem
- Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. I: Algorithmic results
- Fair repetitive interval scheduling
- The complexity ecology of parameters: An illustration using bounded max leaf number
- Parameterized algorithms for variations of vertex-edge domination in graphs
- Improved algorithms and complexity results for power domination in graphs
- Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm
- Dynamic programming and planarity: improved tree-decomposition based algorithms
This page was built for publication: Improved tree decomposition based algorithms for domination-like problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3044360)
