Pages that link to "Item:Q2343087"
From MaRDI portal
The following pages link to On sparsification for computing treewidth (Q2343087):
Displaying 8 items.
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- Best-case and worst-case sparsifiability of Boolean CSPs (Q786033) (← links)
- Sparsification lower bound for linear spanners in directed graphs (Q2055974) (← links)
- Sparsification upper and lower bounds for graph problems and not-all-equal SAT (Q2408194) (← links)
- FPT is characterized by useful obstruction sets (Q2828222) (← links)
- (Q2867085) (redirect page) (← links)
- (Q5009477) (← links)
- (Q6065467) (← links)
