Twin-treewidth: a single-exponential logic-based approach

DOI10.1007/978-3-031-49614-1_3MaRDI QIDQ6606218zbMATH OpenFDO

Authors Uéverton S. Souza, Bruno Lopes

Publication date 16 September 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49614-1_3

zbMATH Keywords

dynamic programmingmodel checkingparameterized complexitytreewidthtwin vertices

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites work

• A partial k-arboretum of graphs with bounded treewidth
• Algorithmic Meta-theorems
• Algorithmic meta-theorems for restrictions of treewidth
• Fundamentals of parameterized complexity
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Graph theory with applications
• scientific article; zbMATH DE number 1868631 (Why is no real title available?)
• Logic and structure.
• Methods for algorithmic meta theorems
• On non-serial dynamic programming
• Optimal tree decompositions revisited: a simpler linear-time FPT algorithm
• Parameterized algorithms
• Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach
• The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues

This page was built for publication: Twin-treewidth: a single-exponential logic-based approach

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