Cluster Editing: Kernelization Based on Edge Cuts

DOI10.1007/978-3-642-17493-3_8zbMath1309.68088arXiv1008.4250OpenAlexW2681681395MaRDI QIDQ3058692

Yixin Cao, Jian'er Chen

Publication date: 7 December 2010

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1008.4250

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

Editing graphs into disjoint unions of dense clusters ⋮ Tight bounds for parameterized complexity of cluster editing with a small number of clusters ⋮ Cluster editing with locally bounded modifications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correlation clustering
• Graph-modeled data clustering: Exact algorithms for clique generation
• A more effective linear kernelization for cluster editing
• Going weighted: parameterized algorithms for cluster editing
• Cluster graph modification problems
• Clustering with qualitative information
• Kernels for Feedback Arc Set In Tournaments
• Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament
• Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
• Exact Algorithms for Cluster Editing: Evaluation and Experiments
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• A 2k Kernel for the Cluster Editing Problem
• Fast FAST
• A Combinatorial Decomposition Theory
• Computing Phylogenetic Roots with Bounded Degrees and Errors
• Efficient Parameterized Preprocessing for Cluster Editing
• Aggregating inconsistent information

This page was built for publication: Cluster Editing: Kernelization Based on Edge Cuts