Cluster Editing
type: Item
instance of: scholarly article
title: Cluster Editing
zbMATH Open document ID: 1387.68177
DOI: 10.1007/978-3-642-39053-1_5
author: Sebastian Böcker
author: Jan Baumbach
published in: Lecture Notes in Computer Science
publication date: 2013-08-05T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6194921
Wikidata QID: Q62779992
MaRDI profile type: Publication
full work available at URL: 978-3-642-39053-1 5
OpenAlex ID: W4234354705
cites work: Approximating Symmetric Relations by Equivalence Relations
cites work: A Note on Approximating Symmetric Relations by Equivalence Relations
cites work: A cutting plane algorithm for a clustering problem
cites work: Clustering of microarray data via clique partitioning
cites work: On best transitive approximations to simple graphs
cites work: Cluster graph modification problems
cites work: Correlation clustering
cites work: NP-hard problems in hierarchical-tree clustering
cites work: Cluster editing with locally bounded modifications
cites work: Which problems have strongly exponential complexity?
cites work: Cluster editing problem for points on the real line: a polynomial time algorithm
cites work: A golden ratio parameterized algorithm for cluster editing
cites work: Q4503944
cites work: Cluster editing: kernelization based on edge cuts
cites work: Tight bounds for parameterized complexity of Cluster Editing
cites work: Clustering with qualitative information
cites work: Aggregating inconsistent information
cites work: Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
cites work: Q4742505
cites work: Q3907360
cites work: Ein Subgradientenverfahren zur Klassifikation qualitativer Daten
cites work: Exact algorithms for cluster editing: Evaluation and experiments
cites work: Exact Algorithms for Cluster Editing: Evaluation and Experiments
cites work: Graph-modeled data clustering: Exact algorithms for clique generation
cites work: Automated generation of search tree algorithms for hard graphs modification problems
cites work: Going weighted: parameterized algorithms for cluster editing
cites work: Even faster parameterized cluster deletion and cluster editing
cites work: Applying modular decomposition to parameterized cluster editing problems
cites work: The Lost Continent of Polynomial Time: Preprocessing and Kernelization
cites work: Efficient Parameterized Preprocessing for Cluster Editing
cites work: A more effective linear kernelization for cluster editing
cites work: A \(2k\) kernel for the cluster editing problem
cites work: Extension and robustness of transitivity clustering for protein-protein interaction network analysis
cites work: Fixed-parameter tractability of multicut parameterized by the size of the cutset
cites work: Multicut is FPT
cites work: Fixed-parameter enumerability of cluster editing and related problems
cites work: Alternative Parameterizations for Cluster Editing
cites work: Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
cites work: On making directed graphs transitive
description: scientific article; zbMATH DE number 6194921