# Find the bivariate cliques from the marginal data.

### Description

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).

### Usage

1 2 |

### Arguments

`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. |

### Value

A list of the maximal cliques of the intersection graph of the data.

### Author(s)

A. Vandal and R. Gentleman

### References

*Graph–Theoretical Aspects of Bivariate Censored
Data*, R. Gentleman and A. Vandal, 1999, submitted.

### See Also

`BVclmat`

, `BVsupport`

### Examples

1 2 |

Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker. Vote for new features on Trello.