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: 1136.68465
DOI: 10.1007/978-3-540-78773-0_61
author: Falk Hüffner
author: Christian Komusiewicz
author: Hannes Moser
author: Rolf Niedermeier
published in: Lecture Notes in Computer Science
publication date: 2008-04-15T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5263951
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-540-78773-0 61
OpenAlex ID: W2147466109
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: Improved Parameterized Upper Bounds for Vertex Cover
cites work: The Cluster Editing Problem: Implementations and Experiments
cites work: Efficient Parameterized Preprocessing for Cluster Editing
cites work: Parameterized Algorithms for Hitting Set: The Weighted Case
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: The disjoint cliques problem
cites work: The node-deletion problem for hereditary properties is NP-complete
cites work: Q5710169
cites work: Applying Modular Decomposition to Parameterized Bicluster Editing
cites work: Finding odd cycle transversals.
cites work: Cluster graph modification problems
description: scientific article; zbMATH DE number 5263951