Abstract :
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.
Keywords :
Compatibility matrix, Hasse diagram, lexicographic ordering, maximal complete subgraphs, spanning tree, symmetric graph.; Automata; Equations; Helium; Inspection; Logic; Manuals; Symmetric matrices; Tree graphs; Vectors; Compatibility matrix, Hasse diagram, lexicographic ordering, maximal complete subgraphs, spanning tree, symmetric graph.;
