Pages that link to "Item:Q2294045"
From MaRDI portal
The following pages link to Extension of Vertex Cover and Independent Set in some classes of graphs (Q2294045):
Displaying 8 items.
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- On the complexity of solution extension of optimization problems (Q2072063) (← links)
- Extension and its price for the connected vertex cover problem (Q2072064) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- Invited talks (Q2692717) (← links)
- Can local optimality be used for efficient data reduction? (Q2692734) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)
- Geodesic packing in graphs (Q6095044) (← links)
