Faster parameterized algorithm for BICLUSTER EDITING

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


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.636k).

Original languageEnglish
Article number106095
JournalInformation Processing Letters
StatePublished - 1 Jun 2021


  • Branching algorithms
  • Graph algorithms
  • Parameterized complexity


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

Cite this