Positive-instance driven dynamic programming for treewidth
From MaRDI portal
Publication:5111757
Recommendations
Cites work
- scientific article; zbMATH DE number 956839 (Why is no real title available?)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A note on exact algorithms for vertex ordering problems on graphs
- An Iterative Heuristic Algorithm for Tree Decomposition
- Complexity of Finding Embeddings in a k-Tree
- Contraction and Treewidth Lower Bounds
- Encoding Treewidth into SAT
- Exact Algorithms for Treewidth and Minimum Fill-In
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. XX: Wagner's conjecture
- On exact algorithms for treewidth
- Principles and Practice of Constraint Programming – CP 2004
- Pseudo Affine Projection Algorithms Revisited: Robustness and Stability Analysis
- Safe separators for treewidth
- Treewidth and minimum fill-in: Grouping the minimal separators
- Treewidth computation and extremal combinatorics
Cited in
(8)- Practical access to dynamic programming on tree decompositions
- The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
- Positive-instance driven dynamic programming for treewidth
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness
- Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm
- scientific article; zbMATH DE number 7651198 (Why is no real title available?)
- The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.
- The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration
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)
