Positive-instance driven dynamic programming for treewidth
From MaRDI portal
Publication:5111757
DOI10.4230/LIPICS.ESA.2017.68zbMATH Open1442.90198OpenAlexW2897005204MaRDI QIDQ5111757FDOQ5111757
Authors: Hisao Tamaki 
Publication date: 27 May 2020
Full work available at URL: https://dblp.uni-trier.de/db/conf/esa/esa2017.html#Tamaki17
Recommendations
Decision theory (91B06) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Dynamic programming (90C39)
Cites Work
- Treewidth computation and extremal combinatorics
- On exact algorithms for treewidth
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A note on exact algorithms for vertex ordering problems on graphs
- Graph minors. XX: Wagner's conjecture
- Complexity of Finding Embeddings in a k-Tree
- Graph minors. II. Algorithmic aspects of tree-width
- Treewidth and minimum fill-in: Grouping the minimal separators
- Exact Algorithms for Treewidth and Minimum Fill-In
- Title not available (Why is that?)
- Contraction and Treewidth Lower Bounds
- Safe separators for treewidth
- Principles and Practice of Constraint Programming – CP 2004
- Pseudo Affine Projection Algorithms Revisited: Robustness and Stability Analysis
- An Iterative Heuristic Algorithm for Tree Decomposition
- Encoding Treewidth into SAT
Cited In (7)
- Solving Graph Problems via Potential Maximal Cliques
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness
- Positive-instance driven dynamic programming for treewidth
- Title not available (Why is that?)
- Practical Access to Dynamic Programming on Tree Decompositions
- Title not available (Why is that?)
- The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.
Uses Software
This page was built for publication: Positive-instance driven dynamic programming for treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111757)
