Pages that link to "Item:Q2343087"
From MaRDI portal
The following pages link to On sparsification for computing treewidth (Q2343087):
Displaying 17 items.
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- Constant-degree graph expansions that preserve treewidth (Q633842) (← links)
- Best-case and worst-case sparsifiability of Boolean CSPs (Q786033) (← links)
- Controlling the data space of tree structured computations (Q1877554) (← links)
- Sparsification lower bound for linear spanners in directed graphs (Q2055974) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- On sparsification for computing treewidth (Q2343087) (← links)
- Sparsification upper and lower bounds for graph problems and not-all-equal SAT (Q2408194) (← links)
- On the hardness of losing width (Q2441542) (← links)
- FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders (Q2828222) (← links)
- (Q2867085) (redirect page) (← links)
- Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (Q3012824) (← links)
- (Q5009477) (← links)
- Losing Treewidth by Separating Subsets (Q5236288) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897572) (← links)
- (Q6065467) (← links)
- Compressing branch-and-bound trees (Q6086013) (← links)