Fast Algorithms for Join Operations on Tree Decompositions
From MaRDI portal
Recommendations
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Faster algorithms on branch and clique decompositions
- Practical algorithms on partial k-trees with an application to domination-like problems
- scientific article; zbMATH DE number 2086260
- The Fine Details of Fast Dynamic Programming over Tree Decompositions
Cites work
- scientific article; zbMATH DE number 4060712 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1361465 (Why is no real title available?)
- scientific article; zbMATH DE number 6783432 (Why is no real title available?)
- A partial k-arboretum of graphs with bounded treewidth
- Algorithms and complexity results for the capacitated vertex cover problem
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Clifford algebras meet tree decompositions
- Computational aspects of the Mobius transformation of graphs
- Cut and count and representative sets on branch decompositions
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Exact and approximate bandwidth
- Fast Zeta Transforms for Lattices with Few Irreducibles
- Faster algorithms on branch and clique decompositions
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
- Fourier meets M\"{o}bius: fast subset convolution
- Optimal dynamic program for r-domination problems over tree decompositions
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Structurally parameterized \(d\)-scattered set
- Treewidth. Computations and approximations
Cited in
(9)- Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. II: Hardness results
- Anti-factor is FPT parameterized by treewidth and list size (but counting is hard)
- scientific article; zbMATH DE number 1553119 (Why is no real title available?)
- Kernelization for counting problems on graphs: preserving the number of minimum solutions
- Computing generalized convolutions faster than brute force
- Degrees and gaps: tight complexity results of general factor problems parameterized by treewidth and cutwidth
- Fundamental problems on bounded-treewidth graphs: the real source of hardness
- Computing generalized convolutions faster than brute force
- Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. I: Algorithmic results
This page was built for publication: Fast Algorithms for Join Operations on Tree Decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5042462)
