|
| 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
| ASCII Text | x | ||
| K.E. Stoffers, "Sequential Algorithm for the Determination of Maximum Compatibles," IEEE Transactions on Computers, vol. 23, no. 1, pp. 95-98, January, 1974. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1974.223786, author = {K.E. Stoffers}, title = {Sequential Algorithm for the Determination of Maximum Compatibles}, journal ={IEEE Transactions on Computers}, volume = {23}, number = {1}, issn = {0018-9340}, year = {1974}, pages = {95-98}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1974.223786}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Sequential Algorithm for the Determination of Maximum Compatibles IS - 1 SN - 0018-9340 SP95 EP98 EPD - 95-98 A1 - K.E. Stoffers, PY - 1974 KW - Compatibility matrix KW - Hasse diagram KW - lexicographic ordering KW - maximal complete subgraphs KW - spanning tree KW - symmetric graph. VL - 23 JA - IEEE Transactions on Computers ER - | |||
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.