Pages that link to "Item:Q5387826"

The following pages link to Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs (Q5387826):

Displaying 27 items.

• Kernel and fast algorithm for dense triplet inconsistency (Q391097) (← links)
• Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
• Obtaining split graphs by edge contraction (Q897961) (← links)
• Deleting edges to restrict the size of an epidemic: a new application for treewidth (Q1635713) (← links)
• Two edge modification problems without polynomial kernels (Q1662097) (← links)
• On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion} (Q1679221) (← links)
• A polynomial kernel for trivially perfect editing (Q1799208) (← links)
• On the threshold of intractability (Q2051847) (← links)
• (Sub)linear kernels for edge modification problems toward structured graph classes (Q2093576) (← links)
• Incompressibility of \(H\)-free edge modification problems (Q2343091) (← links)
• Faster parameterized algorithms for deletion to split graphs (Q2350905) (← links)
• An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs (Q2354311) (← links)
• Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
• A cubic-vertex kernel for flip consensus tree (Q2441594) (← links)
• Completion to chordal distance-hereditary graphs: a quartic vertex-kernel (Q2672433) (← links)
• Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem (Q2676471) (← links)
• A cubic vertex-kernel for \textsc{Trivially Perfect Editing} (Q2696282) (← links)
• Exploring the subexponential complexity of completion problems (Q2828210) (← links)
• Polynomial Kernels for Proper Interval Completion and Related Problems (Q3088286) (← links)
• Parameterized Complexity of Eulerian Deletion Problems (Q3104771) (← links)
• Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth (Q3467872) (← links)
• Two Edge Modification Problems without Polynomial Kernels (Q3656868) (← links)
• Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5150814) (← links)
• Node-and edge-deletion NP-complete problems (Q5402565) (← links)
• Quadratic vertex kernel for split vertex deletion (Q5896158) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
• Parameterized complexity of the \(\mathcal{T}_{h+1} \)-free edge deletion problem (Q6546594) (← links)