Bicluster Editing with Overlaps: A Vertex Splitting Approach

TL;DR

This paper introduces the Bicluster Editing with Vertex Splitting problem, addressing limitations of traditional biclustering by allowing overlapping clusters through vertex splitting, and provides complexity and algorithmic results.

Contribution

It formulates the BCEVS and BCEOVS problems, proves their NP-completeness, establishes hardness results, and shows fixed-parameter tractability for BCEOVS.

Findings

NP-complete even for bipartite planar graphs of degree three

No subexponential algorithms under ETH for these problems

BCEOVS is fixed-parameter tractable with a polynomial kernel

Abstract

The BiCluster Editing problem aims at editing a given bipartite graph into a disjoint union of bicliques via a minimum number of edge deletion or addition operations. As a graph-based model for data clustering, the problem aims at a partition of the input dataset, which cannot always obtain meaningful clusters when some data elements are expected to belong to more than one cluster each. To address this limitation, we introduce the Bicluster Editing with Vertex Splitting problem (BCEVS) which consists of finding a minimum sequence of edge editions and vertex splittings such that the resulting graph is a disjoint union of bicliques. The vertex splitting operation consists of replacing a vertex $v$ with two vertices whose union of neighborhoods is the neighborhood of $v$. We also introduce the problem of Bicluster Editing with One-Sided Vertex Splitting (BCEOVS) where we restrict the splitting operations to the only one set of the two sets forming the bipartition. We prove that the two problems are NP-complete even when restricted to bipartite planar graphs of maximum degree three. Moreover, assuming the {\sc Exponential Time Hypothesis} holds, there is no $2^{o(n)}n^{O(1)}$-time (resp. $2^{o(\sqrt{n})}n^{O(1)}$-time) algorithm for BCEVS and BCEOVS on bipartite (resp. planar) graphs with maximum degree three, where $n$ is the number of vertices of the graph. Furthermore we prove both problems are APX-hard and solvable in polynomial time on trees. On the other hand, we prove that BCEOVS is fixed-parameter tractable with respect to solution size by showing that it admits a polynomial size kernel.