biclique: Maximal Biclique Enumeration in Bipartite Graphs

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>.

Version: 1.0.5
Depends: R (≥ 3.4.0)
Imports: graphics, utils
Published: 2020-03-03
Author: Yuping Lu [aut, cre, cph], Charles Phillips [aut], Michael Langston [aut], Department of Computer Science, University of Tennessee, Knoxville [cph]
Maintainer: Yuping Lu <yupinglu89 at>
License: GPL-2 | file LICENSE
NeedsCompilation: yes
Materials: README NEWS
CRAN checks: biclique results


Reference manual: biclique.pdf


Package source: biclique_1.0.5.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): biclique_1.0.5.tgz, r-oldrel (arm64): biclique_1.0.5.tgz, r-release (x86_64): biclique_1.0.5.tgz, r-oldrel (x86_64): biclique_1.0.5.tgz
Old sources: biclique archive


Please use the canonical form to link to this page.