A polynomial kernel for 3-leaf power deletion
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 7559376 (Why is no real title available?)
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- A kernel of order 2k-c k for vertex cover
- A polynomial kernel for block graph deletion
- A polynomial kernel for distance-hereditary vertex deletion
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
- Approximation and kernelization for chordal vertex deletion
- Decomposition of Directed Graphs
- Distance-hereditary graphs
- Error compensation in leaf power problems
- Faster parameterized algorithms using linear programming
- Feedback vertex set inspired kernel for chordal vertex deletion
- Fixed-parameter algorithms for cluster vertex deletion
- Fundamentals of parameterized complexity
- Improved upper bounds for vertex cover
- Interval vertex deletion admits a polynomial kernel
- Kernelization. Theory of parameterized preprocessing
- Linear time solvable optimization problems on graphs of bounded clique-width
- On graph powers for leaf-labeled trees
- Parameterized algorithms
- Parameterized complexity of vertex deletion into perfect graph classes
- Parameterized leaf power recognition via embedding into graph products
- Some remarks about leaf roots
- Structure and linear time recognition of 3-leaf powers
- Structure and linear-time recognition of 4-leaf powers
- Subquadratic kernels for implicit 3-{\textsc{Hitting Set}} and 3-{\textsc{Set Packing}} problems
- The 3-Steiner Root Problem
- The 4-Steiner Root problem
- The NLC-width and clique-width for powers of graphs of bounded tree-width
- The node-deletion problem for hereditary properties is NP-complete
Cited in
(2)
This page was built for publication: A polynomial kernel for 3-leaf power deletion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6046945)
