New upper bound heuristics for treewidth
From MaRDI portal
Recommendations
Cited in
(14)- Turbocharging treewidth heuristics
- Tree decomposition and discrete optimization problems: a survey
- Constructing Brambles
- Encoding Treewidth into SAT
- New lower and upper bounds for graph treewidth
- Turbocharging treewidth heuristics
- Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
- Contraction and Treewidth Lower Bounds
- Weighted Treewidth Algorithmic Techniques and Results
- A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
- Contraction and treewidth lower bounds
- Heuristic and metaheuristic methods for computing graph treewidth
- Treewidth computations. I: Upper bounds
- On the maximum cardinality search lower bound for treewidth
This page was built for publication: New upper bound heuristics for treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710021)