Pages that link to "Item:Q1680268"
From MaRDI portal
The following pages link to SAT-based local improvement for finding tree decompositions of small width (Q1680268):
Displaying 11 items.
- SAT-encodings for special treewidth and pathwidth (Q1680270) (← links)
- Practical access to dynamic programming on tree decompositions (Q2005578) (← links)
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
- Finding good tree decompositions by local search (Q2839209) (← links)
- (Q4944974) (← links)
- A SAT Approach to Branchwidth (Q4972153) (← links)
- Practical Access to Dynamic Programming on Tree Decompositions (Q5009563) (← links)
- (Q5009587) (← links)
- An Experimental Study of the Treewidth of Real-World Graph Data (Q5091123) (← links)
- Theory and Applications of Satisfiability Testing (Q5325870) (← links)
- SAT-boosted tabu search for coloring massive graphs (Q6579769) (← links)