Pages that link to "Item:Q2266936"
From MaRDI portal
The following pages link to Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936):
Displayed 4 items.
- The \(k\)-hop connected dominating set problem: hardness and polyhedra (Q324721) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
- On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators (Q3181057) (← links)