Pages that link to "Item:Q482281"
From MaRDI portal
The following pages link to On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281):
Displaying 7 items.
- On the parameterized complexity of b-\textsc{chromatic number} (Q340565) (← links)
- Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs (Q1733857) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- An efficient local search framework for the minimum weighted vertex cover problem (Q2282264) (← links)
- Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints (Q2867069) (← links)
- Constraint solving via fractional edge covers (Q3581534) (← links)
