A polynomial kernel for block graph deletion

DOI10.4230/LIPICS.IPEC.2015.270MaRDI QIDQ5363781zbMATH OpenFDO

Authors Eun Jung Kim, O-joung Kwon

Publication date 29 September 2017

Full work available at URL https://doi.org/10.4230/LIPICS.IPEC.2015.270

zbMATH Keywords

polynomial kernelblock graphsingle-exponential FPT algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A polynomial kernel for block graph deletion
• A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
• Approximation and kernelization for chordal vertex deletion
• Approximation and kernelization for chordal vertex deletion
• Parameterized vertex deletion problems for hereditary graph classes with a block property

Cited in

(10)

• Smaller kernels for two vertex deletion problems
• Feedback vertex set inspired kernel for chordal vertex deletion
• Feedback vertex set inspired kernel for chordal vertex deletion
• A polynomial kernel for distance-hereditary vertex deletion
• A Polynomial Kernel for Proper Interval Vertex Deletion
• Polynomial Kernel for Interval Vertex Deletion
• A polynomial kernel for block graph deletion
• A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
• Parameterized vertex deletion problems for hereditary graph classes with a block property
• A polynomial kernel for bipartite permutation vertex deletion

This page was built for publication: A polynomial kernel for block graph deletion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363781)