Pages that link to "Item:Q2408194"
From MaRDI portal
The following pages link to Sparsification upper and lower bounds for graph problems and not-all-equal SAT (Q2408194):
Displaying 9 items.
- Best-case and worst-case sparsifiability of Boolean CSPs (Q786033) (← links)
- Sparsification lower bound for linear spanners in directed graphs (Q2055974) (← links)
- Optimal data reduction for graph coloring using low-degree polynomials (Q2272594) (← links)
- Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
- (Q5009477) (← links)
- Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials (Q5111881) (← links)
- Parameterized Pre-Coloring Extension and List Coloring Problems (Q5857010) (← links)
- (Q5874535) (← links)
- (Q6065467) (← links)
