A generic convolution algorithm for join operations on tree decompositions
From MaRDI portal
Publication:2117110
DOI10.1007/978-3-030-79416-3_27OpenAlexW3177271366MaRDI QIDQ2117110
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-79416-3_27
Related Items (1)
Cites Work
- Unnamed Item
- 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
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Fourier meets M\"{o}bius: fast subset convolution
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Computational aspects of the Mobius transformation of graphs
- Fast Hamiltonicity Checking Via Bases of Perfect Matchings
- Optimal dynamic program for r-domination problems over tree decompositions
- 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: A generic convolution algorithm for join operations on tree decompositions
