Fast Algorithms for Join Operations on Tree Decompositions
From MaRDI portal
Publication:5042462
DOI10.1007/978-3-030-42071-0_18OpenAlexW3017735120MaRDI QIDQ5042462
Publication date: 19 October 2022
Published in: Treewidth, Kernels, and Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.01588
dynamic programmingfast Fourier transformtree decompositionsMöbius transformfast subset convolutionsigma-rho domination
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact and approximate bandwidth
- A partial k-arboretum of graphs with bounded treewidth
- Treewidth. Computations and approximations
- Structurally parameterized \(d\)-Scattered Set
- Clifford algebras meet tree decompositions
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
- Algorithms and complexity results for the capacitated vertex cover problem
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
- Fourier meets M\"{o}bius: fast subset convolution
- Faster Algorithms on Branch and Clique Decompositions
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Computational aspects of the Mobius transformation of graphs
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Fast Hamiltonicity Checking Via Bases of Perfect Matchings
- Optimal dynamic program for r-domination problems over tree decompositions
- Cut and Count and representative sets on branch decompositions
- Fast Zeta Transforms for Lattices with Few Irreducibles
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
This page was built for publication: Fast Algorithms for Join Operations on Tree Decompositions
