Pages that link to "Item:Q5346539"
From MaRDI portal
The following pages link to Dichotomy Results on the Hardness of $H$-free Edge Modification Problems (Q5346539):
Displaying 13 items.
- Incompressibility of \(H\)-free edge modification problems: towards a dichotomy (Q2071824) (← links)
- A polynomial kernel for diamond-free editing (Q2072105) (← links)
- On subgraph complementation to \(H\)-free Graphs (Q2088585) (← links)
- On subgraph complementation to \(H\)-free graphs (Q2672430) (← links)
- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel (Q2672433) (← links)
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing} (Q2696282) (← links)
- A Polynomial Kernel for Diamond-Free Editing (Q5009567) (← links)
- Destroying Bicolored $P_3$s by Deleting Few Edges (Q5038193) (← links)
- A Polynomial Kernel for Line Graph Deletion (Q5874512) (← links)
- (Q5874544) (← links)
- (Q6089654) (← 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)
