An algorithm to look for maximum "edge" biclique
-
Updated
Oct 22, 2021 - C
An algorithm to look for maximum "edge" biclique
an implementation of maximal biclique enumeration algorithm from Alexe et al. (https://www.sciencedirect.com/science/article/pii/S0166218X04000629)
Benchmark for Maximum Edge biclique in a Bipartite Graph
JAVA implementation of MBEA algorithm from the paper: Zhang, Y., Phillips, C., Rogers, G., Baker, E., Chesler, E. and Langston, M. (2014). On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. BMC Bioinformatics, 15(1), p.110.
Python wrapper for C++ implementation of Maximal Biclique enumeration algorithm (https://www.sciencedirect.com/science/article/pii/S0166218X04000629)
Add a description, image, and links to the biclique topic page so that developers can more easily learn about it.
To associate your repository with the biclique topic, visit your repo's landing page and select "manage topics."