Finding the Maximum k- Balanced Biclique on Weighted Bipartite Graphs (Extended abstract)

As a popular data structure, bipartite graph is widely used to model the complex relationships between two types of entities widely in many real world application domains[1]. Detecting cohesive subgraphs, such as biclique, is a fundamental problem in graph analysis[2], [3]. Given a bipartite graph $G$, a subgraph $B=(X,\ Y)$ is a biclique if $B$ is a complete subgraph.