Polynomial Kernel Achieves O(k⁵) for Clique‑Tree Graph Deletion

Researchers present a polynomial kernel of O(k^5) vertices for Clique-Tree deletion, the first such result for scattered graph classes. The preprint appeared on 21 September 2024. getnews.me/polynomial-kernel-achiev... #graphalgorithms #kernelization

Quadratic Kernel Achieves O(k²) Vertices for Cliques-or-Trees Deletion

Researchers present a quadratic kernel for Cliques-or-Trees Vertex Deletion that limits instances to O(k²) vertices, tightening the earlier O(k⁴) and O(k⁵) kernels. Read more: getnews.me/quadratic-kernel-achieve... #kernelization #graphalgorithms