Faster parameterized algorithm for Bicluter Editing

TL;DR

This paper presents a faster fixed-parameter algorithm for the Bicluster Editing problem, improving the computational efficiency for transforming a graph into a bicluster graph within a given edge modification limit.

Contribution

The paper introduces an improved algorithm with a running time of O*(3.116^k) for Bicluster Editing, advancing the state-of-the-art in parameterized complexity.

Findings

Algorithm runs in O*(3.116^k) time

Enhanced efficiency over previous methods

Applicable to large graphs with small k

Abstract

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)$.