Returns a list of maximal cliques of the intersection graph of the
real valued intervals supplied in m. These are one dimensional
intervals with one interval for each individual. The algorithm is
coded in interpreted code and should be moved to compiled code for speed.
How do we handle exact failure times?
Which algorithm is used?
Usage
Maclist(intvls, Lopen=TRUE, Ropen=FALSE)
Arguments
intvls
A n by 2 matrix, the first column is the left endpoints and
the second column contains the right endpoints of the failure time
intervals.
Lopen
A boolean indicating whether the intervals are open on
the left.
Ropen
A boolean indicating whether the intervals are open on
the right.
Value
A list of length m. Each element of the list corresponds to one
maximal antichain. The row numbers (from m) identify the
individuals and all row numbers for the individuals in the maximal
clique. Maximal cliques occur in their natural (left to right) order.
References
Computational Methods for Censored Data using Intersection
Graphs, R. Gentleman and A. Vandal, JCGS, 2000.