A generic convolution algorithm for join operations on tree decompositions
type: Item
instance of: scholarly article
title: A generic convolution algorithm for join operations on tree decompositions
DOI: 10.1007/978-3-030-79416-3_27
author: Johan M. M. Van Rooij
publication date: 2022-03-21T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7493547
MaRDI profile type: Publication
full work available at URL: 978-3-030-79416-3 27
OpenAlex ID: W3177271366
cites work: Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
cites work: Fourier meets M\"{o}bius: fast subset convolution
cites work: Q5743488
cites work: Q3795218
cites work: Q4291429
cites work: Q4699283
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
cites work: Optimal dynamic program for r-domination problems over tree decompositions
cites work: An Algorithm for the Machine Calculation of Complex Fourier Series
cites work: Fast Hamiltonicity Checking Via Bases of Perfect Matchings
cites work: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
cites work: Exact and approximate bandwidth
cites work: Structurally parameterized \(d\)-Scattered Set
cites work: Computational aspects of the Mobius transformation of graphs
cites work: Treewidth. Computations and approximations
cites work: Q5365080
cites work: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
cites work: Clifford algebras meet tree decompositions
description: scientific article; zbMATH DE number 7493547