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.
Published in:
Computers, IEEE Transactions on
(Volume:C-23
,
Issue:
1
)
Date of Publication: Jan. 1974