Pages that link to "Item:Q5232758"
From MaRDI portal
The following pages link to SAT-Encodings for Treecut Width and Treedepth (Q5232758):
Displaying 6 items.
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427) (← links)
- On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
- Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
- Computing optimal hypertree decompositions with SAT (Q6067037) (← links)
- (Q6089676) (← links)
- The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. (Q6089686) (← links)
