The following pages link to A SAT Approach to Clique-Width (Q2946763):
Displaying 14 items.
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- On the query complexity of clique size and maximum satisfiability (Q1816736) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- Computing properties of stable configurations of thermodynamic binding networks (Q2315010) (← links)
- A characterisation of clique-width through nested partitions (Q2348055) (← links)
- Bounding clique-width via perfect graphs (Q2424685) (← links)
- A SAT Approach to Branchwidth (Q2818011) (← links)
- Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width (Q3569083) (← links)
- (Q4714131) (← links)
- Induced betweenness in order-theoretic trees (Q5038203) (← links)
- (Q5326473) (redirect page) (← links)
- Computing optimal hypertree decompositions with SAT (Q6067037) (← links)
- Quantified Boolean Solving for Achievement Games (Q6488139) (← links)
- Succinct data structures for bounded clique-width graphs (Q6497944) (← links)
