The following pages link to Parameterized Power Vertex Cover (Q3181050):
Displaying 14 items.
- Approximability of the vertex cover problem in power-law graphs (Q385960) (← links)
- Parameterized algorithm for eternal vertex cover (Q765521) (← links)
- Structurally parameterized \(d\)-scattered set (Q2064293) (← links)
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
- Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
- Parameterized (approximate) defective coloring (Q3304104) (← links)
- Graph Layout Problems Parameterized by Vertex Cover (Q3596727) (← links)
- (Q4560263) (redirect page) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- Parameterized (Approximate) Defective Coloring (Q5107096) (← links)
- (Q5136270) (← links)
- (Q5874480) (← links)
- Approximating power node-deletion problems (Q6057334) (← links)
- Approximating power node-deletion problems (Q6593676) (← links)