Fixed-parameter algorithms for cluster vertex deletion
type: Item
instance of: scholarly article
title: Fixed-parameter algorithms for cluster vertex deletion
zbMATH Open document ID: 1205.68263
author: Falk Hüffner
author: Christian Komusiewicz
author: Hannes Moser
author: Rolf Niedermeier
published in: Theory of Computing Systems
publication date: 2010-08-13T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5770229
zbMATH Keywords: parameterized complexity
zbMATH Keywords: iterative compression
zbMATH Keywords: NP-hard problems
zbMATH Keywords: graph algorithms
zbMATH Keywords: clustering
MaRDI profile type: Publication
full work available at URL: s00224-008-9150-x
OpenAlex ID: W3101793140
cites work: Kernelization Algorithms for d-Hitting Set Problems
cites work: Kernels: Annotated, Proper and Induced
cites work: Aggregating inconsistent information
cites work: Going Weighted: Parameterized Algorithms for Cluster Editing
cites work: Fixed-parameter tractability of graph modification problems for hereditary properties
cites work: An approximation algorithm for feedback vertex sets in tournaments
cites work: Improved Parameterized Upper Bounds for Vertex Cover
cites work: The Cluster Editing Problem: Implementations and Experiments
cites work: Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
cites work: Efficient Parameterized Preprocessing for Cluster Editing
cites work: Parameterized Algorithms for Hitting Set: The Weighted Case
cites work: Iterative Compression and Exact Algorithms
cites work: Faster Scaling Algorithms for Network Problems
cites work: Q3002775
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: Iterative Compression for Exactly Solving NP-Hard Minimization Problems
cites work: Q3600916
cites work: The disjoint cliques problem
cites work: The node-deletion problem for hereditary properties is NP-complete
cites work: On the hardness of approximating minimization problems
cites work: Q5710169
cites work: On efficient fixed-parameter algorithms for weighted vertex cover
cites work: A general method to speed up fixed-parameter-tractable algorithms
cites work: Applying modular decomposition to parameterized cluster editing problems
cites work: Parameterized algorithms for feedback set problems and their duals in tournaments
cites work: Finding odd cycle transversals.
cites work: Cluster graph modification problems
cites work: Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
DOI: 10.1007/S00224-008-9150-X
description: scientific article; zbMATH DE number 5770229