Benchmark for Maximum Edge biclique in a Bipartite Graph
-
Updated
Jun 4, 2021 - Java
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.
Add a description, image, and links to the finding-bicliques topic page so that developers can more easily learn about it.
To associate your repository with the finding-bicliques topic, visit your repo's landing page and select "manage topics."