Complexity of Dense Bicluster Editing Problems
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).
KeywordsBicluster editing Parameterized complexity Data reduction NP-hardness
Unable to display preview. Download preview PDF.
- 2.Ailon, N., Avigdor-Elgrabli, N., Liberty, E.: An improved algorithm for bipartite correlation clustering. arXiv preprint arXiv:1012.3011 (2010)Google Scholar
- 7.Cheng, Y., Church, G.M.: Biclustering of expression data. In: ISMB, vol. 8, pp. 93–103 (2000)Google Scholar
- 9.Fellows, M.R., Downey, R.G.: Parameterized complexity (1999)Google Scholar
- 19.Sun, P., Guo, J., Baumbach, J.: Integrated simultaneous analysis of different biomedical data types with exact weighted bi-cluster editing. Journal of Integrative Bioinformatics 9(2), 197 (2012)Google Scholar
- 20.van Zuylen, A.: Deterministic approximation algorithms for ranking and clustering problems. Technical Report 1431. School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY (2005)Google Scholar