Faster parameterized algorithm for Bicluter Editing.

Research output: Contribution to journalArticle


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 kedges. In this paper we give an algorithm for Bicluster Editing whose running time is O∗(2.636k)
Original languageEnglish GB
Article number106095
JournalInformation Processing Letters
StatePublished - 2019


Dive into the research topics of 'Faster parameterized algorithm for Bicluter Editing.'. Together they form a unique fingerprint.

Cite this