Pages that link to "Item:Q602747"
From MaRDI portal
The following pages link to Polynomial kernels for 3-leaf power graph modification problems (Q602747):
Displaying 13 items.
- Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
- Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
- An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs (Q2354311) (← links)
- A cubic-vertex kernel for flip consensus tree (Q2441594) (← links)
- Error compensation in leaf power problems (Q2498407) (← links)
- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel (Q2672433) (← links)
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing} (Q2696282) (← links)
- Polynomial Kernels for Proper Interval Completion and Related Problems (Q3088286) (← links)
- Algorithms and Computation (Q5712129) (← links)
- On three polynomial kernels of sequences for arbitrarily partitionable graphs (Q5962512) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
