Pages that link to "Item:Q3467861"
From MaRDI portal
The following pages link to Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems (Q3467861):
Displaying 4 items.
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
- Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem (Q2676471) (← links)
- A Note on the Minimum H-Subgraph Edge Deletion (Q2947962) (← links)
- Dichotomy Results on the Hardness of $H$-free Edge Modification Problems (Q5346539) (← links)