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):
Displayed 4 items.
- Connected vertex covers in dense graphs (Q974753) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs (Q3057621) (← links)
- Connected Vertex Covers in Dense Graphs (Q3541785) (← links)