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.31 k ), and for 2-Club Cluster Edge Deletion a fixed parameter algorithm with running time O*(2.74 k ). © 2012 Springer-Verlag.
CITATION STYLE
Liu, H., Zhang, P., & Zhu, D. (2012). On editing graphs into 2-club clusters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7285 LNCS, pp. 235–246). https://doi.org/10.1007/978-3-642-29700-7_22
Mendeley helps you to discover research relevant for your work.