Pages that link to "Item:Q1799208"
From MaRDI portal
The following pages link to A polynomial kernel for trivially perfect editing (Q1799208):
Displaying 19 items.
- Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
- On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion} (Q1679221) (← links)
- Unit interval vertex deletion: fewer vertices are relevant (Q1747495) (← links)
- A polynomial kernel for trivially perfect editing (Q1799208) (← links)
- Paths to trees and cacti (Q1998842) (← links)
- On the threshold of intractability (Q2051847) (← links)
- (Sub)linear kernels for edge modification problems toward structured graph classes (Q2093576) (← links)
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes (Q2232241) (← links)
- Edge deletion problems: branching facilitated by modular decomposition (Q2257301) (← links)
- Polynomial kernelization for removing induced claws and diamonds (Q2398208) (← links)
- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel (Q2672433) (← links)
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing} (Q2696282) (← links)
- Exploring the Subexponential Complexity of Completion Problems (Q2828210) (← links)
- Fast Quasi-Threshold Editing (Q3452790) (← links)
- (Q3452805) (redirect page) (← links)
- Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems (Q3467861) (← links)
- Paths to Trees and Cacti (Q5283353) (← links)
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (Q6084414) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
