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

DOI10.1007/978-3-031-49614-1_3MaRDI QIDQ6606218

Bruno Lopes, Uéverton S. Souza, Author name not available (Why is that?)

Publication date: 16 September 2024

zbMATH Keywords

dynamic programmingtreewidthmodel checkingparameterized complexitytwin vertices

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fundamentals of parameterized complexity
• A partial k-arboretum of graphs with bounded treewidth
• Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
• Algorithmic meta-theorems for restrictions of treewidth
• Optimal tree decompositions revisited: a simpler linear-time FPT algorithm
• On non-serial dynamic programming
• Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach
• Algorithmic Meta-theorems
• The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
• Parameterized Algorithms
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Logic and structure.

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)