Pages that link to "Item:Q2945207"
From MaRDI portal
The following pages link to Between Treewidth and Clique-Width (Q2945207):
Displaying 7 items.
- Solving Hamiltonian cycle by an EPT algorithm for a non-sparse parameter (Q2357164) (← links)
- Maximum matching width: new characterizations and a fast algorithm for dominating set (Q2413973) (← links)
- Parameterized Compilation Lower Bounds for Restricted CNF-Formulas (Q2817997) (← links)
- Between Treewidth and Clique-Width (Q2945207) (← links)
- (Q4638063) (← links)
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (Q5092404) (← links)
- Structural parameterizations of budgeted graph coloring (Q5918737) (← links)
