A generic convolution algorithm for join operations on tree decompositions
From MaRDI portal
Publication:2117110
DOI10.1007/978-3-030-79416-3_27OpenAlexW3177271366MaRDI QIDQ2117110FDOQ2117110
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-79416-3_27
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Algorithm for the Machine Calculation of Complex Fourier Series
- A partial k-arboretum of graphs with bounded treewidth
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Treewidth. Computations and approximations
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Fourier meets M\"{o}bius: fast subset convolution
- Computational aspects of the Mobius transformation of graphs
- Exact and approximate bandwidth
- Fast Hamiltonicity Checking Via Bases of Perfect Matchings
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Optimal dynamic program for r-domination problems over tree decompositions
- Structurally parameterized \(d\)-Scattered Set
- Clifford algebras meet tree decompositions
Cited In (2)
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)
