Finding Maximal Bicliques

Question

I have a problem that I was able to model as finding maximal bicliques (complete bipartite graphs) in a bipartite graph. I am aware of the Bron–Kerbosch algorithm for detecting maximal cliques, and it seems to me that there should be a way to express a biclique problem as a clique one. Does anyone have a solution, either for forming a biclique problem as a clique one, or as an available algorithm for detecting bicliques directly?

Answer 1

There's the following implementation of maximal biclique enumeration algorithm from Consensus algorithms for the generation of all maximal bicliques by Alexe et.al..

The theoretical running time is O(Bn^3) where B is the number of maximal bicliques.