A 2k Kernel for the Cluster Editing Problem

DOI10.1007/978-3-642-14031-0_49zbMath1286.05164OpenAlexW1863171180MaRDI QIDQ3578346

Jie Meng, Jian'er Chen

Publication date: 20 July 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14031-0_49

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Genetics and epigenetics (92D10)

Related Items (11)

Polynomial kernels for proper interval completion and related problems ⋮ Even faster parameterized cluster deletion and cluster editing ⋮ On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems ⋮ Graph-based data clustering with overlaps ⋮ Editing graphs into disjoint unions of dense clusters ⋮ Complexity and parameterized algorithms for cograph editing ⋮ Cluster editing: kernelization based on edge cuts ⋮ Cluster Editing: Kernelization Based on Edge Cuts ⋮ Alternative Parameterizations for Cluster Editing ⋮ Polynomial Kernels for Proper Interval Completion and Related Problems ⋮ The Multi-parameterized Cluster Editing Problem

This page was built for publication: A 2k Kernel for the Cluster Editing Problem