Sequential Algorithm for the Determination of Maximum Compatibles
Karl E. Stoffers · IEEE Transactions on Computers · 1974
This correspondence describes an algorithm which finds the maximum compatibles (maximal complete subgraphs of a symmetric graph) sequentially and in lexicographic order. The algorithm is intended for use in digital computers, where it requires only a small program and very little memory space.