Faster parameterized algorithm for Bicluter Editing

10/17/2019

∙

by   Dekel Tsur, et al.

∙

0

∙

share

In the Bicluter Editing problem the input is a 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^*(3.116^k).