A generic convolution algorithm for join operations on tree decompositions

DOI10.1007/978-3-030-79416-3_27MaRDI QIDQ2117110zbMATH OpenOpenAlexFDO

Authors Johan M. M. Van Rooij

Publication date 21 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-79416-3_27

Mathematics Subject Classification ID

Theory of computing (68Qxx)

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
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Clifford algebras meet tree decompositions
• Computational aspects of the Mobius transformation of graphs
• 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
• 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
• Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
• Structurally parameterized \(d\)-scattered set
• Treewidth. Computations and approximations

Cited in

(6)

• scientific article; zbMATH DE number 1553119 (Why is no real title available?)
• Structural parameterizations for two bounded degree problems revisited
• Computing generalized convolutions faster than brute force
• Solving Co-Path/Cycle Packing and Co-Path Packing faster than \(3^k\)
• 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: A generic convolution algorithm 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 Q2117110)