This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sequential Algorithm for the Determination of Maximum Compatibles
January 1974 (vol. 23 no. 1)
pp. 95-98
K.E. Stoffers, Department of Electrical Engineering, Californiania State University
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.
Index Terms:
Compatibility matrix, Hasse diagram, lexicographic ordering, maximal complete subgraphs, spanning tree, symmetric graph.
Citation:
K.E. Stoffers, "Sequential Algorithm for the Determination of Maximum Compatibles," IEEE Transactions on Computers, vol. 23, no. 1, pp. 95-98, Jan. 1974, doi:10.1109/T-C.1974.223786
Usage of this product signifies your acceptance of the Terms of Use.