Nothing
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>.
Getting started
Browse package contents
Package details |
|
|---|---|
| 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@gmail.com> |
| License | GPL-2 | file LICENSE |
| Version | 1.0.5 |
| URL | https://github.com/YupingLu/biclique |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the biclique package in your browser
Any scripts or data that you put into this service are public.
