Pages that link to "Item:Q5434404"
From MaRDI portal
The following pages link to A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth (Q5434404):
Displaying 11 items.
- Treewidth lower bounds with brambles (Q926284) (← links)
- On the maximum cardinality search lower bound for treewidth (Q997060) (← links)
- An extended depth-first search algorithm for optimal triangulation of Bayesian networks (Q2374531) (← links)
- New branch-and-bound algorithms for \(k\)-cardinality tree problems (Q2840678) (← links)
- On exact algorithms for treewidth (Q2933641) (← links)
- A Local Search Algorithm for Branchwidth (Q3075536) (← links)
- Encoding Treewidth into SAT (Q3637156) (← links)
- Estimating the Size of Branch-and-Bound Trees (Q5085999) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
- Weighted Treewidth Algorithmic Techniques and Results (Q5387824) (← links)
- Experimental and Efficient Algorithms (Q5710021) (← links)
