Maximal clique analysis produces a covering, as opposed to a partition,
i.e. objects can belong to more than one clique, and every object belongs to at
least one clique. The maximal clique solution is solved for by symbolic
computation, as opposed to numerical computation, and produces a unique
solution. The number of cliques produced cannot be known beforehand,
and can significantly exceed the number of objects. The ‘mult’ argument controls the
size of the stack to hold intermediate terms in the equation as the solution
proceeds. At each iteration, the algorithm simplifies the equation to the
extent possible, and recovers space used to hold terms that have been
eliminated. Nonetheless, it is possible for the equation to grow quite large at
intermediate steps. The initial value of ‘mult=100’ sets the stack to
100 times the number of objects in the dissimilarity/distance matrix. If the
memory allocated is exceeded, the output is set to NULL, and a message is printed
to increase the ‘mult’ argument to a higher value.