Going weighted: parameterized algorithms for cluster editing
type: Item
instance of: scholarly article
title: Going weighted: parameterized algorithms for cluster editing
zbMATH Open document ID: 1178.68373
author: Q.-B. Bui
author: Sebastian Böcker
author: Sebastian Briesemeister
author: Anke Truss
published in: Theoretical Computer Science
publication date: 2009-11-25T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5638323
zbMATH Keywords: exact algorithms
zbMATH Keywords: fixed-parameter tractability
zbMATH Keywords: data clustering
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.05.006
OpenAlex ID: W2133729430
cites work: Exact Algorithms for Cluster Editing: Evaluation and Experiments
cites work: The Cluster Editing Problem: Implementations and Experiments
cites work: A cutting plane algorithm for a clustering problem
cites work: Automated generation of search tree algorithms for hard graphs modification problems
cites work: Graph-modeled data clustering: Exact algorithms for clique generation
cites work: A more effective linear kernelization for cluster editing
cites work: NP-hard problems in hierarchical-tree clustering
cites work: Q5710169
cites work: A general method to speed up fixed-parameter-tractable algorithms
cites work: Cluster graph modification problems
cites work: Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
DOI: 10.1016/J.TCS.2009.05.006
description: scientific article; zbMATH DE number 5638323