Fast Algorithms for Join Operations on Tree Decompositions
type: Item
instance of: scholarly article
title: Fast Algorithms for Join Operations on Tree Decompositions
DOI: 10.1007/978-3-030-42071-0_18
author: Johan M. M. Van Rooij
published in: Treewidth, Kernels, and Algorithms
publication date: 2022-10-19T00:00:00Z
full work available at URL: https://arxiv.org/abs/2006.01588
Mathematics Subject Classification ID: 68-XX
zbMATH DE Number: 7604217
zbMATH Keywords: tree decompositions
zbMATH Keywords: dynamic programming
zbMATH Keywords: fast Fourier transform
zbMATH Keywords: Möbius transform
zbMATH Keywords: fast subset convolution
zbMATH Keywords: sigma-rho domination
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W3017735120
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: Fast Zeta Transforms for Lattices with Few Irreducibles
cites work: Q3795218
cites work: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
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: Faster Algorithms on Branch and Clique Decompositions
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: Cut and Count and representative sets on branch decompositions
cites work: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
cites work: Algorithms and complexity results for the capacitated vertex cover problem
cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees
cites work: Clifford algebras meet tree decompositions
description: scientific article; zbMATH DE number 7604217