Even faster parameterized cluster deletion and cluster editing
type: Item
instance of: scholarly article
title: Even faster parameterized cluster deletion and cluster editing
zbMATH Open document ID: 1260.05156
author: Sebastian Böcker
author: Peter Damaschke
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6150428
zbMATH Keywords: graph algorithms
zbMATH Keywords: cluster deletion
zbMATH Keywords: cluster editing
zbMATH Keywords: parameterized complexity
zbMATH Keywords: graph transformation
zbMATH Keywords: edge deletion
zbMATH Keywords: eddge editing
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.05.003
OpenAlex ID: W2052073858
cites work: Q4393480
cites work: Q5710169
cites work: The Cluster Editing Problem: Implementations and Experiments
cites work: Graph-modeled data clustering: Exact algorithms for clique generation
cites work: Cluster graph modification problems
cites work: Fixed-parameter algorithms for cluster vertex deletion
cites work: Fixed-parameter enumerability of cluster editing and related problems
cites work: Going weighted: parameterized algorithms 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: Automated generation of search tree algorithms for hard graphs modification problems
cites work: Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
cites work: Cluster editing problem for points on the real line: a polynomial time algorithm
cites work: Beyond the flow decomposition barrier
DOI: 10.1016/J.IPL.2011.05.003
description: scientific article; zbMATH DE number 6150428