Cluster editing: kernelization based on edge cuts
type: Item
instance of: scholarly article
title: Cluster editing: kernelization based on edge cuts
zbMATH Open document ID: 1253.68144
author: Yixin Cao
author: Jianer Chen
published in: Algorithmica
publication date: 2012-11-21T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6109459
zbMATH Keywords: cluster editing
zbMATH Keywords: parameterized computation
zbMATH Keywords: kernelization
zbMATH Keywords: edge-cut
zbMATH Keywords: bioinformatics
MaRDI profile type: Publication
full work available at URL: s00453-011-9595-1
OpenAlex ID: W2170771113
cites work: Fast FAST
cites work: Correlation clustering
cites work: Average parameterization and partial kernelization for computing medians
cites work: Kernels for feedback arc set in tournaments
cites work: Going weighted: parameterized algorithms for cluster editing
cites work: Clustering with qualitative information
cites work: A 2k Kernel for the Cluster Editing Problem
cites work: A Combinatorial Decomposition Theory
cites work: Efficient Parameterized Preprocessing for Cluster Editing
cites work: Graph-modeled data clustering: Exact algorithms for clique generation
cites work: A more effective linear kernelization for cluster editing
cites work: Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament
cites work: NP-hard problems in hierarchical-tree clustering
cites work: Cluster graph modification problems
cites work: Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
DOI: 10.1007/S00453-011-9595-1
description: scientific article; zbMATH DE number 6109459