Polynomial kernels for 3-leaf power graph modification problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 53860 (Why is no real title available?)
- scientific article; zbMATH DE number 2080275 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A More Effective Linear Kernelization for Cluster Editing
- Algorithms and Computation
- Closest 4-leaf power is fixed-parameter tractable
- Cluster analysis and mathematical programming
- Cluster graph modification problems
- Complexity classification of some edge modification problems
- Efficient Parameterized Preprocessing for Cluster Editing
- Error compensation in leaf power problems
- Exact Algorithms for Cluster Editing: Evaluation and Experiments
- Graph-Theoretic Concepts in Computer Science
- Graph-modeled data clustering: Exact algorithms for clique generation
- On Problems without Polynomial Kernels (Extended Abstract)
- On graph powers for leaf-labeled trees
- Parameterized and Exact Computation
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- Structure and linear time recognition of 3-leaf powers
- Structure and linear-time recognition of 4-leaf powers
- The 3-Steiner Root Problem
- The Cluster Editing Problem: Implementations and Experiments
- Tree Powers
Cited in
(15)- Polynomial kernels for proper interval completion and related problems
- Error compensation in leaf power problems
- Graph-Theoretic Concepts in Computer Science
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- On three polynomial kernels of sequences for arbitrarily partitionable graphs
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?
- An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs
- A cubic-vertex kernel for flip consensus tree
- A survey of parameterized algorithms and the complexity of edge modification
- Closest 4-leaf power is fixed-parameter tractable
- Polynomial kernels for 3-leaf power graph modification problems
- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing}
- Polynomial kernels for proper interval completion and related problems
- Algorithms and Computation
This page was built for publication: Polynomial kernels for 3-leaf power graph modification problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q602747)
