A tool for enumerating maximal complete bipartite graphs. The input should be a edge list file or a binary matrix file. The output are maximal complete bipartite graphs. Algorithms used can be found in this paper Y. Lu et al. BMC Res Notes 13, 88 (2020) <doi:10.1186/s13104-020-04955-0>.
https://anaconda.org/r/r-biclique/badges/version.svg
https://anaconda.org/r/r-biclique/badges/latest_release_date.svg
https://anaconda.org/r/r-biclique/badges/latest_release_relative_date.svg
https://anaconda.org/r/r-biclique/badges/platforms.svg
https://anaconda.org/r/r-biclique/badges/license.svg
https://anaconda.org/r/r-biclique/badges/downloads.svg