On Editing Graphs into 2-Club Clusters
type: Item
instance of: scholarly article
title: On Editing Graphs into 2-Club Clusters
zbMATH Open document ID: 1304.68063
DOI: 10.1007/978-3-642-29700-7_22
author: Peng Zhang
author: Daming Zhu
author: Hong Liu
published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management
publication date: 2012-07-16T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6057338
zbMATH Keywords: fixed parameter tractability
zbMATH Keywords: graph-based data clustering
zbMATH Keywords: 2-club cluster graph
MaRDI profile type: Publication
full work available at URL: 978-3-642-29700-7 22
OpenAlex ID: W2133148645
Recommended article: Editing Graphs into Disjoint Unions of Dense Clusters
Recommended article: Editing graphs into disjoint unions of dense clusters
Recommended article: Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes
Recommended article: On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering
Recommended article: On 2-clubs in graph-based data clustering: theory and algorithm engineering
Recommended article: On the Clique Editing Problem
Recommended article: The Cluster Editing Problem: Implementations and Experiments
Recommended article: A 2k Kernel for the Cluster Editing Problem
Recommended article: A \(2k\) kernel for the cluster editing problem
Recommended article: Cluster Editing in Multi-Layer and Temporal Graphs.
description: scientific article; zbMATH DE number 6057338