Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs

Abstract

Given a bipartite graph, the maximum balanced biclique (MBB) problem, discovering a mutually connected while equal-sized disjoint sets with the maximum cardinality, plays a significant role for mining the bipartite graph and has numerous applications. Despite the NP-hardness of the MBB problem, in this paper, we show that an exact MBB can be discovered extremely fast in bipartite graphs for real applications. We propose two exact algorithms dedicated for dense and sparse bipartite graphs respectively. For dense bipartite graphs, an O * (1.3803 n ) algorithm is proposed. This