On the parameterized complexity of computing tree-partitions

DOI10.4230/LIPICS.IPEC.2022.7MaRDI QIDQ6969005zbMATH OpenFDO

Authors Hans L. Bodlaender, Carla Groenland, H. Jacob

Publication date 23 June 2025

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

treewidthapproximation algorithmsparameterized complexityparameterized algorithmstree partitionsdomino treewidthtree-partition-width

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: On the parameterized complexity of computing tree-partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969005)