דקל צור

In the BICLUSTER EDITING problem the input is a bipartite graph G and an integer k, and the goal is to decide whether G can be transformed into a bicluster graph by adding and removing at most k edges. In this paper we give an algorithm for BICLUSTER EDITING whose running time is O^⁎(2.636^k).