greedy_decom: Greedy Algorithm to Find a Biclique
In dpuelz/CliqueRT: Randomization-Based Testing of Causal Effects under General Interference
greedy_decom R Documentation
Greedy Algorithm to Find a Biclique
Description
This function returns a biclique in a null-exposure graph using a greedy algorithm. The
minimum number of focal assignments in the biclique is num_ass.
Usage
greedy_decom(ne, num_ass)
Arguments
ne
The null-exposure graph
num_ass
Controls the minimum number of focal assignments in the biclique found
by the algorithm (algorithm runtime is sensitive to this value).
Value
A biclique of the input null-exposure graph ne.
dpuelz/CliqueRT documentation built on Jan. 6, 2023, 11:20 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.
| greedy_decom | R Documentation |
Greedy Algorithm to Find a Biclique
Description
This function returns a biclique in a null-exposure graph using a greedy algorithm. The
minimum number of focal assignments in the biclique is num_ass.
Usage
greedy_decom(ne, num_ass)
Arguments
ne |
The null-exposure graph |
num_ass |
Controls the minimum number of focal assignments in the biclique found by the algorithm (algorithm runtime is sensitive to this value). |
Value
A biclique of the input null-exposure graph ne.
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.