A novel algorithm for enumerating maximal bicliques from a symmetric matrix

摘要

We address the problem of enumerating maximal bicliques from a symmetric matrix. We propose a novel algorithm named TWINBLADE which exploits the properties of symmetric matrix, and reduces the search space to a larger extent and it generates not even a single duplicate. Our algorithm is compared with LCM-MBC algorithm, in the experiment conducted, ours take almost only half the running time of LCM-MBC for sparse and comparatively performs better for dense datasets.