The following pages link to A SAT Approach to Branchwidth (Q4972153):
Displaying 8 items.
- Satisfiability, branch-width and Tseitin tautologies (Q430830) (← links)
- SAT-based local improvement for finding tree decompositions of small width (Q1680268) (← links)
- SAT-encodings for special treewidth and pathwidth (Q1680270) (← links)
- Constructive linear time algorithms for branchwidth (Q4571992) (← links)
- Theory and Applications of Satisfiability Testing (Q5325870) (← links)
- Logics in Artificial Intelligence (Q5394151) (← links)
- Fast FPT-approximation of branchwidth (Q6083542) (← links)
- SAT-boosted tabu search for coloring massive graphs (Q6579769) (← links)