On fast enumeration of pseudo bicliques

Abstract

Pseudo bicliques relax the rigid connectivity requirement of bicliques to effectively deal with missing data. In this paper, we propose an algorithm based on reverse search to generate all pseudo bicliques in a given graph. We introduce various enhancements to our algorithm based on the structure of pseudo bicliques and underlying bipartite graph. We perform composite analysis using theoretical bounds and computational experiments, to show that these improvements significantly reduce the running time of our algorithm. Our algorithm is optimal in the sense that it takes average linear time to generate each pseudo biclique. © 2011 Springer-Verlag.