Pages that link to "Item:Q5387826"
From MaRDI portal
The following pages link to Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs (Q5387826):
Displayed 14 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)
- A polynomial kernel for trivially perfect editing (Q1799208) (← links)
- On the threshold of intractability (Q2051847) (← 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)
- 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)