Positive-instance driven dynamic programming for treewidth
From MaRDI portal
Publication:2424727
DOI10.1007/s10878-018-0353-zzbMath1426.90250arXiv1704.05286OpenAlexW2963352550MaRDI QIDQ2424727
Publication date: 25 June 2019
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.05286
Related Items (15)
Experimental Analysis of Treewidth ⋮ An analysis of the parameterized complexity of periodic timetabling ⋮ Finding optimal triangulations parameterized by edge clique cover ⋮ Solving projected model counting by utilizing treewidth and its limits ⋮ On the hardness of inclusion-wise minimal separators enumeration ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. ⋮ Practical access to dynamic programming on tree decompositions ⋮ Unnamed Item ⋮ Computing treewidth on the GPU ⋮ On the tree-depth and tree-width in heterogeneous random graphs ⋮ House of graphs 2.0: a database of interesting graphs and more ⋮ The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs ⋮ ProCount: weighted projected model counting with graded project-join trees
Uses Software
Cites Work
- Unnamed Item
- Graph minors. XX: Wagner's conjecture
- Safe separators for treewidth
- Listing all potential maximal cliques of a graph
- Treewidth computation and extremal combinatorics
- Treewidth and Minimum Fill-in: Grouping the Minimal Separators
- On exact algorithms for treewidth
- An Iterative Heuristic Algorithm for Tree Decomposition
- Exact Algorithms for Treewidth and Minimum Fill-In
- Encoding Treewidth into SAT
- Graph minors. II. Algorithmic aspects of tree-width
- Complexity of Finding Embeddings in a k-Tree
- Contraction and Treewidth Lower Bounds
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
This page was built for publication: Positive-instance driven dynamic programming for treewidth
