A 2k kernel for the cluster editing problem

DOI10.1007/978-3-642-14031-0_49MaRDI QIDQ3578346zbMATH OpenOpenAlexFDO

Authors Jie Meng, Jianer 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)

Recommendations

• A 2k kernel for the cluster editing problem
• A more effective linear kernelization for cluster editing
• A More Effective Linear Kernelization for Cluster Editing
• Cluster editing: kernelization based on edge cuts
• Cluster editing: kernelization based on edge cuts

Cited in

(23)

• A more effective linear kernelization for cluster editing
• Cluster editing: kernelization based on edge cuts
• Even faster parameterized cluster deletion and cluster editing
• On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
• On the complexity of multi-parameterized cluster editing
• Parameterized algorithms for min-max 2-cluster editing
• The Multi-parameterized Cluster Editing Problem
• Cluster editing with locally bounded modifications revisited
• On Editing Graphs into 2-Club Clusters
• Cluster editing: kernelization based on edge cuts
• Alternative parameterizations for cluster editing
• Polynomial kernels for proper interval completion and related problems
• Editing graphs into few cliques: complexity, approximation, and kernelization schemes
• A More Effective Linear Kernelization for Cluster Editing
• Polynomial kernels for proper interval completion and related problems
• A 2k kernel for the cluster editing problem
• Graph-based data clustering with overlaps
• Kernelization and parameterized complexity of star editing and union editing
• Cluster editing
• Efficient Parameterized Preprocessing for Cluster Editing
• Fast FPT-Algorithms for Cleaning Grids
• Editing graphs into disjoint unions of dense clusters
• Complexity and parameterized algorithms for cograph editing

This page was built for publication: A \(2k\) kernel for the cluster editing problem

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