computeBicliques: Identify bicliques.
In corybrunson/missing: Handling and removing missing data
Description
This function identifies the maximal bicliques in a give bipartite graph. It
was obtained from http://stackoverflow.com/a/31048125/4556798 on 1
September 2015.
Usage
1
computeBicliques(graph, k = 2, l = 2)
Arguments
graph
A bipartite graph.
k
Integer; the minimum number of nodes of type FALSE. Defaults
to 2.
l
Integer; the minimum number of nodes of type TRUE. Defaults
to 2.
corybrunson/missing documentation built on May 13, 2019, 10:52 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description
This function identifies the maximal bicliques in a give bipartite graph. It was obtained from http://stackoverflow.com/a/31048125/4556798 on 1 September 2015.
Usage
1 | computeBicliques(graph, k = 2, l = 2)
|
Arguments
graph |
A bipartite graph. |
k |
Integer; the minimum number of nodes of type |
l |
Integer; the minimum number of nodes of type |
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.