Complexity of Dense Bicluster Editing Problems

Peng Sun, Jiong Guo, Jan Baumbach

Research output: Chapter in Book/Report/Conference proceedingBook chapterResearchpeer-review

Abstract

Given a density measure Π, an undirected graph G and a nonnegative integer k, a Π-CLUSTER EDITING problem is to decide whether G can be modified into a graph where all connected components are Π-cliques, by at most k edge modifications. Previous studies have been conducted on the complexity and fixed-parameter tractability (FPT) of Π-CLUSTER EDITING based on several different density measures. However, whether these conclusions hold on bipartite graphs is yet to be examined. In this paper, we focus on three different density measures for bipartite graphs: (1) having at most s missing edges for each vertex (s-biplex), (2) having average degree at least |V| − s (average-s-biplex) and (3) having at most s missing edges within a single disjoint component (s-defective bicliques). First, the NP-completeness of the three problems is discussed and afterwards we show all these problems are fixed-parameter tractable with respect to the parameter (s,k).
Original languageEnglish
Title of host publicationComputing and Combinatorics : 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings
EditorsZhipeng Cai, Alex Zelikovsky, Anu Bourgeois
Number of pages12
PublisherSpringer
Publication date2014
Pages154-165
ISBN (Print)978-3-319-08782-5
ISBN (Electronic)978-3-319-08783-2
DOIs
Publication statusPublished - 2014
Event20th International Conference on Computing and Combinatorics - Atlanta, GA, United States
Duration: 4. Aug 20146. Aug 2014

Conference

Conference20th International Conference on Computing and Combinatorics
Country/TerritoryUnited States
CityAtlanta, GA
Period04/08/201406/08/2014
SeriesLecture Notes in Computer Science
Volume8591
ISSN0302-9743

Keywords

  • Bicluster editing
  • Parameterized complexity
  • Data reduction
  • NP-hardness

Cite this