Practical Access to Dynamic Programming on Tree Decompositions

DOI10.4230/LIPIcs.ESA.2018.6OpenAlexW2964058227MaRDI QIDQ5009563

Sebastian Berndt, Max Bannach

Publication date: 4 August 2021

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

zbMATH Keywords

treewidthmodel-checkingfixed-parameter tractability

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Unnamed Item ⋮ Parameterized Leaf Power Recognition via Embedding into Graph Products ⋮ Parameterized leaf power recognition via embedding into graph products

Uses Software

• D-FLAT
• GitHub
• Jdrasil

Cites Work

• Unnamed Item
• Courcelle's theorem -- a game-theoretic approach
• SAT-based local improvement for finding tree decompositions of small width
• The complexity of first-order and monadic second-order logic revisited
• Parametrized complexity theory.
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• The D-FLAT System for Dynamic Programming on Tree Decompositions
• Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning
• Jdrasil: A Modular Library for Computing Tree Decompositions
• Positive-Instance Driven Dynamic Programming for Treewidth.
• Parameterized Algorithms
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

This page was built for publication: Practical Access to Dynamic Programming on Tree Decompositions