Fixed-parameter enumerability of cluster editing and related problems
type: Item
instance of: scholarly article
title: Fixed-parameter enumerability of cluster editing and related problems
zbMATH Open document ID: 1209.68360
author: Peter Damaschke
published in: Theory of Computing Systems
publication date: 2010-05-10T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5706002
zbMATH Keywords: cluster graphs
zbMATH Keywords: soft clustering
zbMATH Keywords: fixed-parameter tractability
zbMATH Keywords: enumeration problems
zbMATH Keywords: true twins
MaRDI profile type: Publication
full work available at URL: s00224-008-9130-1
OpenAlex ID: W2019003450
cites work: Correlation clustering
cites work: Computing Phylogenetic Roots with Bounded Degrees and Errors
cites work: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
cites work: The Cluster Editing Problem: Implementations and Experiments
cites work: Q4808679
cites work: edge dominating set: Efficient Enumeration-Based Exact Algorithms
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: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
cites work: Fixed-Parameter Algorithms for Cluster Vertex Deletion
cites work: NP-hard problems in hierarchical-tree clustering
cites work: Q4472526
cites work: Q4398828
cites work: Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
cites work: Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants
cites work: Cluster graph modification problems
cites work: Computing and Combinatorics
DOI: 10.1007/S00224-008-9130-1
description: scientific article; zbMATH DE number 5706002