@inbook{8279479f50c148089d106b0a17caaf6a,

title = "Complexity of Dense Bicluster Editing Problems",

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).",

keywords = "Bicluster editing, Parameterized complexity, Data reduction, NP-hardness",

author = "Peng Sun and Jiong Guo and Jan Baumbach",

year = "2014",

doi = "10.1007/978-3-319-08783-2_14",

language = "English",

isbn = "978-3-319-08782-5",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "154--165",

editor = "Zhipeng Cai and Alex Zelikovsky and Anu Bourgeois",

booktitle = "Computing and Combinatorics",

address = "Germany",

note = "null ; Conference date: 04-08-2014 Through 06-08-2014",

}