Graph-based data clustering with overlaps
type: Item
instance of: scholarly article
title: Graph-based data clustering with overlaps
zbMATH Open document ID: 1248.90070
author: Michael R. Fellows
author: Jiong Guo
author: Christian Komusiewicz
author: Rolf Niedermeier
author: Johannes Uhlmann
published in: Discrete Optimization
publication date: 2012-10-16T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6094028
zbMATH Keywords: cluster graph modification problems
zbMATH Keywords: forbidden subgraph characterization
zbMATH Keywords: NP-hardness
zbMATH Keywords: fixed-parameter tractability
zbMATH Keywords: \(W[1]\)-hardness
zbMATH Keywords: kernelization
Wikidata QID: Q57359689
MaRDI profile type: Publication
full work available at URL: j.disopt.2010.09.006
OpenAlex ID: W1998839458
cites work: Graph clustering
cites work: Cluster graph modification problems
cites work: A 2k Kernel for the Cluster Editing Problem
cites work: Fixed-parameter enumerability of cluster editing and related problems
cites work: The Cluster Editing Problem: Implementations and Experiments
cites work: Efficient Parameterized Preprocessing for Cluster Editing
cites work: Graph-modeled data clustering: Exact algorithms for clique generation
cites work: A more effective linear kernelization for cluster editing
cites work: Applying modular decomposition to parameterized cluster editing problems
cites work: Correlation clustering
cites work: Going weighted: parameterized algorithms for cluster editing
cites work: A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
cites work: Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs
cites work: NP-hard approximation problems in overlapping clustering.
cites work: Q4393480
cites work: Parametrized complexity theory.
cites work: Q5710169
cites work: Kernelization: New Upper and Lower Bound Techniques
cites work: Algorithm Theory - SWAT 2004
cites work: Q4071280
cites work: Q3053461
cites work: NP-hard problems in hierarchical-tree clustering
cites work: The maximum edge biclique problem is NP-complete
cites work: Fixed-parameter tractability of graph modification problems for hereditary properties
cites work: Q3128916
cites work: Editing Graphs into Disjoint Unions of Dense Clusters
DOI: 10.1016/J.DISOPT.2010.09.006
description: scientific article; zbMATH DE number 6094028