Pages that link to "Item:Q4973877"
From MaRDI portal
The following pages link to Hardness of Approximation for <i>H</i> -free Edge Modification Problems (Q4973877):
Displaying 4 items.
- A polynomial kernel for diamond-free editing (Q2072105) (← links)
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems (Q3058699) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- Cutting a tree with subgraph complementation is hard, except for some small trees (Q6595520) (← links)