On editing graphs into 2-club clusters

Authors:
Hong Liu;Peng Zhang;Daming Zhu
Affiliations:
School of Computer Science and Technology, Shandong University, Shandong, China,Provincial Key Laboratory of Software Engineering, Jinan, China;School of Computer Science and Technology, Shandong University, Shandong, China,Provincial Key Laboratory of Software Engineering, Jinan, China;School of Computer Science and Technology, Shandong University, Shandong, China,Provincial Key Laboratory of Software Engineering, Jinan, China
Venue:
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Year:
2012

Citing 9
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Correlation Clustering

Machine Learning
Cluster graph modification problems

Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
On problems without polynomial kernels

Journal of Computer and System Sciences
Fixed-Parameter Algorithms for Cluster Vertex Deletion

Theory of Computing Systems - Special Section: Algorithmic Game Theory; Guest Editors: Burkhard Monien and Ulf-Peter Schroeder
A More Relaxed Model for Graph-Based Data Clustering: $s$-Plex Cluster Editing

SIAM Journal on Discrete Mathematics
Editing Graphs into Disjoint Unions of Dense Clusters

Algorithmica
Survey of clustering algorithms

IEEE Transactions on Neural Networks
Parameterized Complexity

Parameterized Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce and study three graph modification problems: 2-Club Cluster Vertex Deletion, 2-Club Cluster Edge Deletion, and 2-Club Cluster Editing. In 2-Club Cluster Vertex Deletion (2-Club Cluster Edge Deletion, and 2-Club Cluster Editing), one is given an undirected graph G and an integer k ≥0, and needs to decide whether it is possible to transform G into a 2-club cluster graph by deleting at most k vertices (by deleting at most k edges, and by deleting and adding totally at most k edges). Here, a 2-club cluster graph is a graph in which every connected component is of diameter 2. We first prove that all these three problems are NP-complete. Then, we present for 2-Club Cluster Vertex Deletion a fixed parameter algorithm with running time O ∗(3.31k ), and for 2-Club Cluster Edge Deletion a fixed parameter algorithm with running time O ∗(2.74k ).