Description Usage Arguments Value Author(s) References See Also Examples
The maximal cliques of the intersection graph are obtained by first finding the cliques for the marginal data and then combining them using the algorithm in Gentleman and Vandal (1999).
1 2 |
intvlx |
The cliques for one marginal component, alternatively the marginal intervals can be supplied. |
intvly |
The cliques for the other marginal component, alternatively the marginal intervals can be supplied. |
Lxopen |
Boolean indicating whether the left end point in the x coordinate is open. |
Rxopen |
Boolean indicating whether the right end point in the x coordinate is open. |
Lyopen |
Boolean indicating whether the left end point in the y coordinate is open. |
Ryopen |
Boolean indicating whether the right end point in the y coordinate is open. |
A list of the maximal cliques of the intersection graph of the data.
A. Vandal and R. Gentleman
Graph–Theoretical Aspects of Bivariate Censored Data, R. Gentleman and A. Vandal, 1999, submitted.
1 2 |
Loading required package: survival
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.