SAT-Encodings for Treecut Width and Treedepth

DOI10.1137/1.9781611975499.10zbMath1430.68206arXiv1911.12995OpenAlexW2906859624MaRDI QIDQ5232758

Stefan Szeider, Robert Ganian, Neha Lodha, Sebastian Ordyniak

Publication date: 13 September 2019

Published in: 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.12995

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational aspects of satisfiability (68R07)

Related Items (6)

Computing optimal hypertree decompositions with SAT ⋮ Unnamed Item ⋮ On structural parameterizations of the bounded-degree vertex deletion problem ⋮ The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. ⋮ Algorithmic Applications of Tree-Cut Width ⋮ Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters

This page was built for publication: SAT-Encodings for Treecut Width and Treedepth