Pages that link to "Item:Q633842"
From MaRDI portal
The following pages link to Constant-degree graph expansions that preserve treewidth (Q633842):
Displaying 6 items.
- Treewidth computations. II. Lower bounds (Q549673) (← links)
- Size-treewidth tradeoffs for circuits computing the element distinctness function (Q1702852) (← links)
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
- Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs (Q1983330) (← links)
- Parameters Tied to Treewidth (Q2978180) (← links)
- EPG-representations with Small Grid-Size (Q4625111) (← links)