Pages that link to "Item:Q3508568"
From MaRDI portal
The following pages link to Complexity and Approximation Results for the Connected Vertex Cover Problem (Q3508568):
Displaying 11 items.
- Approximability of the vertex cover problem in power-law graphs (Q385960) (← links)
- Complexity and approximation of the connected set-cover problem (Q453623) (← links)
- Connected vertex covers in dense graphs (Q974753) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← 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)
- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs (Q3057621) (← links)
- Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation (Q3467859) (← links)
- Connected Vertex Covers in Dense Graphs (Q3541785) (← links)
- Connected Set Cover Problem and Its Applications (Q5434403) (← links)
- Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)