CRAN/E | biclique

biclique

Maximal Biclique Enumeration in Bipartite Graphs

Installation

About

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.

github.com/YupingLu/biclique
Bug report File report

Key Metrics

Version 1.0.5
R ≥ 3.4.0
Published 2020-03-03 1697 days ago
Needs compilation? yes
License GPL-2
License File
CRAN checks biclique results

Downloads

Yesterday 0
Last 7 days 4 -81%
Last 30 days 80 +21%
Last 90 days 217 +14%
Last 365 days 993 -21%

Maintainer

Maintainer

Yuping Lu

Authors

Yuping Lu

aut / cre / cph

Charles Phillips

aut

Michael Langston

aut

Department of Computer Science
University of Tennessee
Knoxville

cph

Material

README
NEWS
Reference manual
Package source

macOS

r-release

arm64

r-oldrel

arm64

r-release

x86_64

r-oldrel

x86_64

Windows

r-devel

x86_64

r-release

x86_64

r-oldrel

x86_64

Old Sources

biclique archive

Depends

R ≥ 3.4.0

Imports

graphics
utils