## It is normally quite quick to identify the maximum clique in a correspondence graph, and hence the MCS

## However, most correspondence graphs contain very large numbers of maximal, but sub-maximum, cliques that must be checked before the identity of the maximum clique is confirmed

## Clique detection algorithms achieve efficiencies in operation by means of bounding and pruning techniques that minimise the number of sub-maximum cliques that need to be checked

Previous slide | Next slide | Back to first slide | View graphic version |